Treffer: Algorithmic randomness, quantum physics, and incompleteness
Title:
Algorithmic randomness, quantum physics, and incompleteness
Authors:
Source:
MCU : machines, computations, and universality (Saint Petersburg, 21-24 September 2004, revised selected papers)Lecture notes in computer science. :1-17
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 57 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithmique, Algorithmics, Algorítmica, Approche probabiliste, Probabilistic approach, Enfoque probabilista, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Machine Turing, Turing machine, Máquina Turing, Modèle Heisenberg, Heisenberg model, Modelo Heisenberg, Mécanique quantique, Quantum mechanics, Mecánica cuántica
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science University of Auckland, New Zealand
ISSN:
0302-9743
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.16894688
Database:
PASCAL Archive
Weitere Informationen
Is randomness in quantum mechanics algorithmically random? Is there any relation between Heisenberg's uncertainty relation and Gödel's incompleteness? Can quantum randomness be used to trespass the Turing's barrier? Can complexity shed more light on incompleteness? In this paper we use variants of algorithmic complexity to discuss the above questions.