RG Downey, DR Hirschfeldt - 2010 - books.google.com
This book is concerned with the theory of computability and complexity over the real numbers. This theory was initiated by Turing, Grzegorczyk, Lacombe, Banach and Mazur …
JH Lutz - Information and Computation, 2003 - Elsevier
A constructive version of Hausdorff dimension is developed using constructive supergales, which are betting strategies that generalize the constructive supermartingales used in the …
Classical fractal dimensions (Hausdorff dimension and packing dimension) have recently been effectivized by (i) characterizing them in terms of real‐valued functions called gales …
JH Lutz, N Lutz - ACM Transactions on Computation Theory (TOCT), 2018 - dl.acm.org
We formulate the conditional Kolmogorov complexity of x given y at precision r, where x and y are points in Euclidean spaces and r is a natural number. We demonstrate the utility of this …
N Lutz, DM Stull - Information and Computation, 2020 - Elsevier
We use Kolmogorov complexity methods to give a lower bound on the effective Hausdorff dimension of the point (x, a x+ b), given real numbers a, b, and x. We apply our main …
One of the serious mental disorders where people interpret reality in an abnormal state is schizophrenia. A combination of extremely disordered thinking, delusion, and hallucination …
R Downey, DR Hirschfeldt, A Nies… - Bulletin of Symbolic …, 2006 - cambridge.org
We report on some recent work centered on attempts to understand when one set is more random than another. We look at various methods of calibration by initial segment …
The two most important notions of fractal dimension are Hausdorff dimension, developed by Hausdorff Math. Ann., 79 (1919), pp. 157–179, and packing dimension, developed …
JS Miller, A Nies - Bulletin of Symbolic Logic, 2006 - cambridge.org
It is time for a new paper about open questions in the currently very active area of randomness and computability. Ambos-Spies and Kučera presented such a paper in 1999 …