๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Kolmogorov complexity of functions of finite smoothness

โœ Scribed by Yuly Makovoz


Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
467 KB
Volume
2
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the Kolmogorov Complexity of Arbitrar
โœ Aaron Shenhar ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 795 KB

The notion of Kolmogorov program-size complexity (or algorithmic information) is defined here for arbitrary objects. Using a special form of recursive topological spaces, called partition spaces, we define a recursive topology which uses a level of partition for approximation of arbitrary objects in

The Kolmogorov complexity of random real
โœ Liang Yu; Decheng Ding; Rodney Downey ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 296 KB
The complexity of functions on lattices
โœ J.W. Sander; R. Tijdeman ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 212 KB

Let f : Z โ†’ {0; 1} be a given function. In 1938, Morse and Hedlund observed that if the number of distinct vectors (f(x + 1); : : : ; f(x + n)), x โˆˆ Z, called complexity, is at most n for some positive integer n, then f is periodic with period at most n. This result is best possible. Functions with

On the smoothness of positive definite a
โœ Holger Wendland ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 596 KB

We consider positive definite and radial functions. After giving general results concerning the smoothness of general positive definite and radial functions, we investigate the class of compactly supported, positive definite, and radial functions, where every function consists of a univariate polyno