X-machines and the halting problem: Building a super-turing machine

DOI10.1007/BF01888233zbMath0707.68034DBLPjournals/fac/Stannett90WikidataQ55968658 ScholiaQ55968658MaRDI QIDQ919823

Mike Stannett

Publication date: 1990

Published in: Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

Turing machinecomputabilityHalting problemsuper-turing

Mathematics Subject Classification ID

Related Items (4)

The promise of analog computation ⋮ Hypercomputation: Philosophical issues ⋮ On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism ⋮ Accelerating machines: a review

Cites Work

• Quantum theory, the Church–Turing principle and the universal quantum computer
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: X-machines and the halting problem: Building a super-turing machine