The diagonalization method in quantum recursion theory

DOI10.1007/S11128-009-0115-ZzbMath1192.81103DBLPjournals/qip/Svozil10arXivhep-th/9412048OpenAlexW2139224171WikidataQ58620614 ScholiaQ58620614MaRDI QIDQ972447

Karl Svozil

Publication date: 26 May 2010

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/hep-th/9412048

zbMATH Keywords

quantum informationHalting problemquantum recursion theory

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook of mathematical logic. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, A. S. Troelstra. 2nd printing
• Conservative logic
• Classical recursion theory. The theory of functions and sets of natural numbers
• Quantum computation and information. From theory to experiment
• Mathematics of Quantum Computation
• Quantum Information
• Dynamical Bias in the Coin Toss
• Computability and Logic
• Introduction to Quantum Computation and Information
• Quantum Computer Science
• Quantum Logics Based on Four-Photon Entanglement
• Noncontextuality in multipartite entanglement
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction

This page was built for publication: The diagonalization method in quantum recursion theory