Transcending the Limits of Turing Computability
Vadim A. Adamyan, Cristian S. Calude, Boris S. Pavlov
Abstract
Hypercomputation or super-Turing computation is a ``computation'' that transcends the limit imposed by Turing's model of computability. The field still faces some basic questions, technical (can we mathematically and/or physically build a hypercomputer?), cognitive (can hypercomputers realize the AI dream?), philosophical (is thinking more than computing?). The aim of this paper is to address the question: can we mathematically build a hypercomputer? We will discuss the solutions of the Infinite Merchant Problem, a decision problem equivalent to the Halting Problem, based on results obtained in Coins,acp. The accent will be on the new computational technique and results rather than formal proofs.
Create a lesson
Related papers
Discovering state-of-the-art quantum circuits with large language models
Andi Gu, Alek H. Kemeny, Susanne F. Yelin et al.
Stability of Quantum LDPC States under Local Pauli Noise
Tai-Hsuan Yang, Andrew D. Kim, Akash Vijay et al.
Magic in quantum trajectory unravelings of noisy random quantum circuits
Sara Santos, Alessio Paviglianiti, Vincenzo Savona
Magna: simulating magic state factories as cheaply as Clifford circuits
Yifei Wang, Yingfei Gu
Classical Capacity of Single-Mode Bosonic Gaussian Channels
Gerardo Adesso, Ludovico Lami, Vittorio Giovannetti
SynDebug: A Framework to Debug Logic Bugs in Fault-Tolerant Quantum Computing Programs
Nicholas S. DiBrita, Jack Lange, Tirthak Patel