0111062v2

related topics
{state, algorithm, problem}
{time, systems, information}
{equation, function, exp}
{let, theorem, proof}
{observables, space, algebra}
{vol, operators, histories}
{state, states, coherent}
{algorithm, log, probability}

Hilbert's Incompleteness, Chaitin's $\Omega$ number and Quantum Physics

Tien D Kieu

abstract: To explore the limitation of a class of quantum algorithms originally proposed for the Hilbert's tenth problem, we consider two further classes of mathematically non-decidable problems, those of a modified version of the Hilbert's tenth problem and of the computation of the Chaitin's $\Omega$ number, which is a representation of the G\"odel's Incompletness theorem. Some interesting connection to Quantum Field Theory is pointed out.

oai_identifier:
oai:arXiv.org:quant-ph/0111062
categories:
quant-ph
comments:
Clarification and new references added
arxiv_id:
quant-ph/0111062
created:
2001-11-10
updated:
2001-11-21

Full article ▸

related documents
0506244v2
0108110v2
0009086v1
9702039v4
0602135v1
0308016v1
0209092v5
0310121v1
0406146v1
0507024v1
0612033v1
0606242v3
0502144v1
0209139v1
0703193v2
0507194v1
0206078v1
0605132v1
0209059v1
0406121v1
0312096v2
0202140v2
0701198v1
0310110v1
0501093v1