Algorithmic randomness, quantum physics, and incompleteness

Algorithmic randomness, quantum physics, and incompleteness (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Cristian S. Calude

Venue:	PROCEEDINGS OF THE CONFERENCE “MACHINES, COMPUTATIONS AND UNIVERSALITY” (MCU’2004), LECTURES NOTES IN COMPUT. SCI. 3354
Citations:	11 - 2 self

BibTeX

@INPROCEEDINGS{Calude04algorithmicrandomness,,
    author = {Cristian S. Calude},
    title = {Algorithmic randomness, quantum physics, and incompleteness},
    booktitle = {PROCEEDINGS OF THE CONFERENCE “MACHINES, COMPUTATIONS AND UNIVERSALITY” (MCU’2004), LECTURES NOTES IN COMPUT. SCI. 3354},
    year = {2004},
    pages = {1--17},
    publisher = {Springer}
}

Bookmark

OpenURL

Abstract

Citations

606	Quantum Theory: Concepts and Methods - Peres - 1994
388	A new kind of science - Wolfram
330	Simulating physics with computers - Feynman - 1982
274	A theory of program size formally identical to information theory - Chaitin - 1975
181	Riemann’s hypothesis and tests for primality - Miller - 1976
173	Various techniques used in connection with random digits - Neumann - 1951
166	Statistical mechanics of cellular automata - Wolfram - 1983
125	On Hilbert’s tenth problem - Matiyasevich - 2000
123	Algorithmic randomness and complexity - Downey, Hirschfeldt - 2010
108	Information and Randomness — An Algorithmic Perspective - Calude - 1994
94	Über den anschaulichen Inhalt der quantentheoretischen Kinematik und Mechanik, Z. Physik 43 - Heisenberg - 1927
79	Probabilistic algorithms - Rabin - 1976
52	Non-Turing computations via Malament-Hogarth space-times - Etesi, Nemeti
43	Relative to a random oracle A, P A ̸= NP A ̸= coNP A with probability 1 - Bennett, Gill - 1981
29	Iterating von Neumann’s procedure for extracting random bits - Peres - 1992
27	The universal computer: the road from Leibniz to Turing - Davis - 2000
25	The myth of hypercomputation - Davis - 2004
25	Computing the Noncomputable - Kieu
24	The random oracle hypothesis is false - Chor, Goldreich, et al. - 1990
21	On the random oracle hypothesis - Kurtz - 1982
20	The quantum coin toss—testing microphysical undecidability - Svozil - 1990
18	Is independence an exception - Calude, Jürgensen, et al. - 1994
17	Zur Quantenmechanik einfacher Bewegungstypen, Zeitschrift für Physik 44 - Kennard - 1927
16	A version of Ω for which ZFC can not predict a single bit - Solovay - 2000
14	Chaitin Ω numbers, Solovay machines and incompleteness, Theoret - Calude
12	What can be efficiently reduced to the Kolmogorov-random strings - Allender, Buhrman, et al. - 2004
11	A fast and compact quantum random number generator - Jennewein, Achleitner, et al.
10	quantum measurements - Coins - 2002
10	A version of Ω for which ZF C can not predict a single bit - Solovay - 2000
9	The Music of the Primes - Sautoy, M - 2003
6	Discours de métaphysique - Leibniz - 1995
6	Dynamics based computation - Sinha, Ditto - 1998
6	Is complexity a source of incompleteness - Calude, Jürgensen - 2005
5	Upper bound by Kolmogorov complexity for the probability in computable POVM measurement, Los Alamos preprint archive - Tadaki - 2002
3	The Feynman Processor. An Introduction to Quantum - Milburn - 1998
2	Do the zeros of Riemann’s zeta–function form a random sequence - Calude, Hertling, et al. - 1997
2	A relation between correctness and randomness in the computation of probabilistic algorithms - Calude, Zimand - 1984
2	The Quest for Omega, Pantheon - MATH - 2005
2	Computing with distributed chaos - Sinha, Ditto - 1999
1	Tests for non-randomness in quantum jumps, Los Alamos preprint archive, http://arxiv.org/abs/physics - Berkeland, Raymondson, et al. - 2004
1	From Heinsenberg to Gödel via Chaitin - Calude, Stay - 2004
1	A note on Monte-Carlo primality tests and algorithmic information theory - Chaitin, Schwartz
1	L’Intelligence and le Calcul - Delahaye - 2002
1	Generation of uniformly distributed random variables on electronic computers - Golenko - 1966
1	Email to C - Oliver - 2004
1	Quantum mechanics and algorithmic randomness - Yurtsever