## Transcending the Limits of Turing Computability (1998)

Citations: | 18 - 7 self |

### BibTeX

@MISC{Adamyan98transcendingthe,

author = {Vadim A. Adamyan and Cristian S. Calude and Boris S. Pavlov},

title = {Transcending the Limits of Turing Computability},

year = {1998}

}

### Years of Citing Articles

### OpenURL

### 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 [9, 2]. The accent will be on the new computational technique and results rather than formal proofs. 1

### Citations

674 | Quantum theory, the Church-Turing principle and the universal quantum computer
- Deutsch
- 1985
(Show Context)
Citation Context ... essential use of some physical theory, relativity theory in [14], quantum theory [9, 21]; they all reflect an attitude advocated by Landauer [22, 23] (information is inevitably physical) and Deutsch =-=[12, 13]-=- (the reason why we find it possible to construct, say, electronic calculators, and indeed why we can perform mental arithmetic ...is that the laws of physics “happen” to permit the existence of physi... |

155 |
The Fabric of Reality: The
- Deutsch
- 1997
(Show Context)
Citation Context ... essential use of some physical theory, relativity theory in [14], quantum theory [9, 21]; they all reflect an attitude advocated by Landauer [22, 23] (information is inevitably physical) and Deutsch =-=[12, 13]-=- (the reason why we find it possible to construct, say, electronic calculators, and indeed why we can perform mental arithmetic ...is that the laws of physics “happen” to permit the existence of physi... |

154 |
Quantum Computing
- Gruska
- 1999
(Show Context)
Citation Context ...s like {OR, NOT} or {NAND}. A set of quantum gates S is called universal if any unitary operation can be approximated with an arbitrary accuracy by a quantum circuit involving gates in S; see more in =-=[16, 17, 19, 8]-=-. 5spectral point p2 = λ > 0 is played by the scattered waves −→ Ψν, ←− Ψν, labeled with vectors ν ∈ E. The components of the scattered waves Ψν(p) in the outer space L2(R) are presented as linear co... |

102 |
Lectures on Computation
- Feynman
- 1996
(Show Context)
Citation Context ...s like {OR, NOT} or {NAND}. A set of quantum gates S is called universal if any unitary operation can be approximated with an arbitrary accuracy by a quantum circuit involving gates in S; see more in =-=[16, 17, 19, 8]-=-. 5spectral point p2 = λ > 0 is played by the scattered waves −→ Ψν, ←− Ψν, labeled with vectors ν ∈ E. The components of the scattered waves Ψν(p) in the outer space L2(R) are presented as linear co... |

95 |
Probability Theory. An Analytic View
- Stroock
- 1993
(Show Context)
Citation Context ...ops”): the equidistant sequence tl = ∑l m=1 δm, for the first space, and the perturbed sequence ˜tl = ∑l m=1 ∆m, for the second space. Both spaces are equipped with proper Wiener measures W, ˜ W (see =-=[29]-=-). The measure W is defined on the algebra of all finite-dimensional cylindrical sets Ct1,t2,...,tN of trajectories with fixed initial point ∆ 1 ,∆ 2 ,...,∆ N x0 = 0 and “gates” ∆l, l = 1, . . .,N (wh... |

81 |
Information is physical
- Landauer
- 1991
(Show Context)
Citation Context ...pecific class of computing procedures, [14, 9, 21, 2] make essential use of some physical theory, relativity theory in [14], quantum theory [9, 21]; they all reflect an attitude advocated by Landauer =-=[22, 23]-=- (information is inevitably physical) and Deutsch [12, 13] (the reason why we find it possible to construct, say, electronic calculators, and indeed why we can perform mental arithmetic ...is that the... |

66 | Non-Turing computations via Malament-Hogarth spacetimes
- Etesi, Nemeti
- 2002
(Show Context)
Citation Context ... are various proposals to break Turing’ Barrier by showing that certain classes of computing procedures have super-Turing power (see [10, 31, 6, 7, 30, 11]). A specific class of computing procedures, =-=[14, 9, 21, 2]-=- make essential use of some physical theory, relativity theory in [14], quantum theory [9, 21]; they all reflect an attitude advocated by Landauer [22, 23] (information is inevitably physical) and Deu... |

60 | Quantum algorithm for hilbert’s tenth problem
- Kieu
(Show Context)
Citation Context ... are various proposals to break Turing’ Barrier by showing that certain classes of computing procedures have super-Turing power (see [10, 31, 6, 7, 30, 11]). A specific class of computing procedures, =-=[14, 9, 21, 2]-=- make essential use of some physical theory, relativity theory in [14], quantum theory [9, 21]; they all reflect an attitude advocated by Landauer [22, 23] (information is inevitably physical) and Deu... |

54 |
Information and Randomness: An Algorithmic Perspective, 2nd Edition, Revised and Extended
- Calude
- 2002
(Show Context)
Citation Context ... that the time of the computation grows indefinitely or by the fact that the space of computation grows indefinitely or both. The classical theories of computability and complexity (see, for example, =-=[5]-=-) do not give any indication in this respect. In the following section we will show that time can be made finite provided we use a specific probabilistic strategy. 24 A Probabilistic Solution In this... |

35 |
The Church-Turing thesis as a guiding principle for physics
- Svozil
- 1998
(Show Context)
Citation Context ...ue of the journal Minds and Machines (12, 4, 2002). Currently there are various proposals to break Turing’ Barrier by showing that certain classes of computing procedures have super-Turing power (see =-=[10, 31, 6, 7, 30, 11]-=-). A specific class of computing procedures, [14, 9, 21, 2] make essential use of some physical theory, relativity theory in [14], quantum theory [9, 21]; they all reflect an attitude advocated by Lan... |

18 |
Computing with Cells and Atoms
- Calude, Păun
- 2001
(Show Context)
Citation Context ...s like {OR, NOT} or {NAND}. A set of quantum gates S is called universal if any unitary operation can be approximated with an arbitrary accuracy by a quantum circuit involving gates in S; see more in =-=[16, 17, 19, 8]-=-. 5spectral point p2 = λ > 0 is played by the scattered waves −→ Ψν, ←− Ψν, labeled with vectors ν ∈ E. The components of the scattered waves Ψν(p) in the outer space L2(R) are presented as linear co... |

13 |
Scattering matrices for microschemes Operator Theory
- Adamyan
- 1992
(Show Context)
Citation Context ...did not click after running the experiment for the time T, is P non-click (N) > 1 − 1 − P(N) P(N) · ) . √ ε √ √∏ (1 + γ) T ∞ − 1 − ε m=1 ∆m . 5 A Brownian Solution Based on Resonance Amplification In =-=[1]-=- the idea to consider a single act of quantum computation as a scattering process was suggested. We will first illustrate the method by describing a simple quantum scattering system realizing the quan... |

13 |
quantum measurements
- Coins
(Show Context)
Citation Context ...estion: 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 =-=[9, 2]-=-. The accent will be on the new computational technique and results rather than formal proofs. 1 Introduction Hypercomputation or super-Turing computation is a “computation” that transcends the limit ... |

13 | Transcending Turing Computability - MacLennan - 2002 |

12 |
Hypercomputation: hype or computation
- Teuscher, Sipper
(Show Context)
Citation Context ...ue of the journal Minds and Machines (12, 4, 2002). Currently there are various proposals to break Turing’ Barrier by showing that certain classes of computing procedures have super-Turing power (see =-=[10, 31, 6, 7, 30, 11]-=-). A specific class of computing procedures, [14, 9, 21, 2] make essential use of some physical theory, relativity theory in [14], quantum theory [9, 21]; they all reflect an attitude advocated by Lan... |

11 |
Quantum mechanical computers, Optics News 11
- Feynman
- 1985
(Show Context)
Citation Context |

11 |
Two-body scattering on a graph and application to simple Nanoelectronic devices
- Melnikov, Pavlov
- 1995
(Show Context)
Citation Context ...nerated by the total Hamiltonian He + Hd + Hint with a proper interaction term. This would lead to a quite sophisticated problem of quantum mechanics, similar to three-body problems, see for instance =-=[26]-=-. We assume now that the state of the dot is selected independently and thus reduce the above problem to the corresponding one-body problem for an electron scattered in the quantum wire depending on t... |

8 | Computing the uncomputable - Casti - 1997 |

8 | Bound states and scattering in quantum waveguides coupled laterally through a boundary window
- Exner, Šeba, et al.
- 1996
(Show Context)
Citation Context ...iting into a specific quantum wire depends on the length of the window. This “switching phenomenon” was discovered by del Alamo and Eugster [3] and intensely discussed in literature, see for instance =-=[15, 4]-=-. We can arrange the setup in such a way that, under normal conditions, the electron exits from the same wire it enters, but switches to the other wire when a classical extra potential is applied, a r... |

7 |
The theory of extensions and explicitly-solvable models
- Pavlov
- 1987
(Show Context)
Citation Context ...(the jump [u ′ ](0) and the value u(0) at the origin) of the component of the wave-function in the outer space and the symplectic coordinates ⃗ ξ± ∈ E of the inner component of the wave-function (see =-=[28]-=-): ( [u ′ ](0) − ⃗ ξ− ) = ( 0 β β + 0 ) ( u(0) ⃗ξ+ ) , (9) we obtain the scattering matrix in the form ( −→T −→ (p) R(p) Sβ(p) = ←− ←− R(p) T (p) ) , with equal transmission and reflection coefficient... |

4 | Quantum electronic devices based on metal-dielectric transition in low-dimensional quantum structures
- Antoniou, Pavlov, et al.
- 1996
(Show Context)
Citation Context ...iting into a specific quantum wire depends on the length of the window. This “switching phenomenon” was discovered by del Alamo and Eugster [3] and intensely discussed in literature, see for instance =-=[15, 4]-=-. We can arrange the setup in such a way that, under normal conditions, the electron exits from the same wire it enters, but switches to the other wire when an extra potential is applied, a realizatio... |

4 |
Information is inevitably physical
- Landauer
- 1999
(Show Context)
Citation Context ...pecific class of computing procedures, [14, 9, 21, 2] make essential use of some physical theory, relativity theory in [14], quantum theory [9, 21]; they all reflect an attitude advocated by Landauer =-=[22, 23]-=- (information is inevitably physical) and Deutsch [12, 13] (the reason why we find it possible to construct, say, electronic calculators, and indeed why we can perform mental arithmetic ...is that the... |

4 | Quantum fieldeffect directional coupler - Alamo, Eugster - 1990 |

3 |
Hypercomputation. Minds and machines
- Copeland
- 2002
(Show Context)
Citation Context ...ue of the journal Minds and Machines (12, 4, 2002). Currently there are various proposals to break Turing’ Barrier by showing that certain classes of computing procedures have super-Turing power (see =-=[10, 31, 6, 7, 30, 11]-=-). A specific class of computing procedures, [14, 9, 21, 2] make essential use of some physical theory, relativity theory in [14], quantum theory [9, 21]; they all reflect an attitude advocated by Lan... |

3 |
Introduction to solid-state theory. Translated from German by
- Madelung
- 1978
(Show Context)
Citation Context ...lectrons have the same constant spin on the quantum circuit R− ∪ R+, with the quantum dot attached. 4 We may assume that the circuit lies on the surface of a semiconductor with Fermi-level α 2 1 (see =-=[25]-=-). We assume that the state of the dot with the level α 2 1 vacant corresponds to Iin = Iout = 0 and the state of the dot with the level α 2 1 occupied corresponds to Iin = Iout = 1. We identify these... |

2 |
A model of zero-range potential with an internal structure, Teor
- Pavlov
- 1984
(Show Context)
Citation Context ...es. To avoid the discussion of the general situation we use here a scattering matrix for a solvable model of the quantum dot which is based on zero-range potential with inner structure, introduced in =-=[27]-=- and already used in [4] for the description of typical features of nano-devices, see also [2]. 3 The transmission coefficients appear on the main diagonal of the matrix to fit the physical meaning of... |

1 | A Quantum Scattering Approach to Undecidable Problems
- Adamyan, Calude, et al.
(Show Context)
Citation Context ...estion: 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 =-=[9, 2]-=-. The accent will be on the new computational technique and results rather than formal proofs. 1 Introduction Hypercomputation or super-Turing computation is a “computation” that transcends the limit ... |

1 |
Personal communication to
- Ignatov
- 1970
(Show Context)
Citation Context ...tack, then the weight of the combination will be 55 + N 100 g; otherwise the weight is just 55 g. The Merchant Problem quoted above was widely spread in allies armies during the Second World War, cf. =-=[20]-=-. Probably the elegant solution described above was the very first solution of a computational problem bearing typical features of quantum computing, see an extended discussion in [9]. 3 The Infinite ... |