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

On the Kolmogorov complexity of continuous real functions

โœ Scribed by Farjudian, Amin

Book ID
120516410
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
239 KB
Volume
164
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Kolmogorov complexity of random real
The Kolmogorov complexity of random reals
โœ Liang Yu; Decheng Ding; Rodney Downey ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 296 KB
On hausdorff and topological dimensions
On hausdorff and topological dimensions of the kolmogorov complexity of the real line
โœ Jin-yi Cai; Juris Hartmanis ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 767 KB

We investigate the Kolmogorov complexity of real numbers. Let K be the Kolmogorov complexity function; we determine the Hausdorff dimension and the topological dimension of the graph of K. Since these dimensions are different, the graph of the Kolmogorov complexity function of the real line forms a

On the complexity of online computations
On the complexity of online computations of real functions
โœ Klaus Weihrauch ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 813 KB

A reasonable computational complexity theory for real functions is obtained by using the modified infinite binary representation with digits 0, 1, and -1 for the real numbers and Turing machines which transform with one-way output modified binary input sequences into modified binary output sequences

On the Kolmogorov Complexity of Arbitrar
On the Kolmogorov Complexity of Arbitrary Objects
โœ 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