Abstract:
Is randomness in quantum mechanics “algorithmically random”?
Is there any relation between Heisenberg’s uncertainty relation
and G¨odel’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.