scientific article; zbMATH DE number 2013798

MaRDI QIDQ4437084zbMATH OpenFDO

Authors Masanao Ozawa

Publication date 7 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2509/25090058.htm

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Quantum computation (81P68)

Recommendations

• scientific article; zbMATH DE number 1379489
• On Halting Process of Quantum Turing Machine
• On the halting problem for a quantum computer
• scientific article; zbMATH DE number 1909831
• IRREVERSIBILITY IN THE HALTING PROBLEM OF QUANTUM COMPUTER

Cited in

(10)

• Unsolvability of the halting problem in quantum dynamics
• Quantum random access stored-program machines
• Partial observation of quantum Turing machines and a weaker well-formedness condition
• On the halting problem for a quantum computer
• On Halting Process of Quantum Turing Machine
• IRREVERSIBILITY IN THE HALTING PROBLEM OF QUANTUM COMPUTER
• scientific article; zbMATH DE number 1542832 (Why is no real title available?)
• scientific article; zbMATH DE number 1379489 (Why is no real title available?)
• scientific article; zbMATH DE number 1418357 (Why is no real title available?)
• Theoretical computer science: computational complexity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4437084)