Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Natural Argument by a Quantum Computer

Vasil Dinev Penchev

Published Jan 1, 2020• 0 citations
Publisher

Abstract

Natural argument is represented as the limit, to which an infinite Turing processconverges. A Turing machine, in which the bits are substituted with qubits, is introduced. Thatquantum Turing machine can recognize two complementary natural arguments in any data.That ability of natural argument is interpreted as an intellect featuring any quantum computer.The property is valid only within a quantum computer: To utilize it, the observer should be sitedinside it. Being outside it, the observer would obtain quite different result depending on thedegree of the entanglement of the quantum computer and observer. All extraordinary propertiesof a quantum computer are due to involving a converging infinite computational process contentingnecessarily both a continuous advancing calculation and a leap to the limit. Three typesof quantum computation can be distinguished according to whether the series is a finite one, aninfinite rational or irrational number

DOI
10.2139/ssrn.3648904

Related papers

A Quantum Computer in a “Chinese Room”

Vasil Dinev Penchev

Pattern recognition is represented as the limit, to which an infinite Turing processconverges. A Turing machine, in which the bits are substituted with qubits, is introduced. Thatquantum Turing machine can recognize two complementary patterns in any data. That ability ofuniversal pattern recognition is interpreted as an intellect featuring any quantum computer. Theproperty is valid only within a quantum computer: To utilize it, the observer should be sited insideit. Being outside it, the observer would obtain quite different result depending on the degreeof the entanglement of the quantum computer and observer. All extraordinary properties ofa quantum computer are due to involving a converging infinite computational process contentingnecessarily both a continuous advancing calculation and a leap to the limit. Three types ofquantum computation can be distinguished according to whether the series is a finite one, an infiniterational or irrational number.

•May 4, 2020•0 citations

A Quantum Computer in a “Chinese Room”

Vasil Dinev Penchev

Pattern recognition is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary patterns in any data. That ability of universal pattern recognition is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number.

•May 4, 2020•0 citations

A Quantum Computer in a “Chinese Room”

Vasil Dinev Penchev

Pattern recognition is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary patterns in any data. That ability of universal pattern recognition is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number.

•May 4, 2020•0 citations

Отвъд машината на Тюринг: квантовият компютър

Vasil Penchev

Quantum computer is considered as a generalization of Turing machine. The bits are substituted by qubits. In turn, a "qubit" is the generalization of "bit" referring to infinite sets or series. It extends the consept of calculation from finite processes and algorithms to infinite ones, impossible as to any Turing machines (such as our computers). However, the concept of quantum computer mets all paradoxes of infinity such as Gödel's incompletness theorems (1931), etc. A philosophical reflection on how quantum computer might implement the idea of "infinite calculation" is the main subject.

•Jan 1, 2014•0 citations

Undecidable, Unrecognizable, and Quantum Computing

Michael Siomau

Quantum computing allows us to solve some problems much faster than existing classical algorithms. Yet, the quantum computer has been believed to be no more powerful than the most general computing model—the Turing machine. Undecidable problems, such as the halting problem, and unrecognizable inputs, such as the real numbers, are beyond the theoretical limit of the Turing machine. I suggest a model for a quantum computer, which is less general than the Turing machine, but may solve the halting problem for any task programmable on it. Moreover, inputs unrecognizable by the Turing machine can be recognized by the model, thus breaking the theoretical limit for a computational task. A quantum computer is not just a successful design of the Turing machine as it is widely perceived now, but is a different, less general but more powerful model for computing, the practical realization of which may need different strategies than those in use now.

Quantum Reports•Jul 1, 2020•3 citations

Quantum Turing Machines: Computations and Measurements

Stefano Guerrini, Simone Martini, Andrea Masini

Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not been fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example being the intrinsic infinite nature of any quantum computation. In this paper, we propose a definition of QTM, which extends and unifies the notions of Deutsch and Bernstein & Vazirani. In particular, we allow both arbitrary quantum input, and meaningful superpositions of computations, where some of them are “terminated” with an “output”, while others are not. For some infinite computations an “output” is obtained as a limit of finite portions of the computation. We propose a natural and robust observation protocol for our QTMs, which does not modify the probability of the possible outcomes of the machines. Finally, we use QTMs to define a class of quantum computable functions—any such function is a mapping from a general quantum state to a probability distribution of natural numbers. We expect that our class of functions, when restricted to classical input-output, will not be different from the set of the recursive functions.

arXiv:1703.07748•Applied Sciences•Aug 11, 2020•11 citations
Natural argument is represented as the limit, to which an infinite Turing processconverges. A Turing machine, in which the bits are substituted with qubits, is introduced. Thatquantum Turing machine can recognize two complementary natural arguments in any data.That ability of natural argument is interpreted as an intellect featuring any quantum computer.The property is valid only within a quantum computer: To utilize it, the observer should be sitedinside it. Being outside it, the observer would obtain quite different result depending on thedegree of the entanglement of the quantum computer and observer. All extraordinary propertiesof a quantum computer are due to involving a converging infinite computational process contentingnecessarily both a continuous advancing calculation and a leap to the limit. Three typesof quantum computation can be distinguished according to whether the series is a finite one, aninfinite rational or irrational number
Pattern recognition is represented as the limit, to which an infinite Turing processconverges. A Turing machine, in which the bits are substituted with qubits, is introduced. Thatquantum Turing machine can recognize two complementary patterns in any data. That ability ofuniversal pattern recognition is interpreted as an intellect featuring any quantum computer. Theproperty is valid only within a quantum computer: To utilize it, the observer should be sited insideit. Being outside it, the observer would obtain quite different result depending on the degreeof the entanglement of the quantum computer and observer. All extraordinary properties ofa quantum computer are due to involving a converging infinite computational process contentingnecessarily both a continuous advancing calculation and a leap to the limit. Three types ofquantum computation can be distinguished according to whether the series is a finite one, an infiniterational or irrational number.
Pattern recognition is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary patterns in any data. That ability of universal pattern recognition is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number.
Pattern recognition is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary patterns in any data. That ability of universal pattern recognition is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number.
Quantum computer is considered as a generalization of Turing machine. The bits are substituted by qubits. In turn, a "qubit" is the generalization of "bit" referring to infinite sets or series. It extends the consept of calculation from finite processes and algorithms to infinite ones, impossible as to any Turing machines (such as our computers). However, the concept of quantum computer mets all paradoxes of infinity such as Gödel's incompletness theorems (1931), etc. A philosophical reflection on how quantum computer might implement the idea of "infinite calculation" is the main subject.
Quantum computing allows us to solve some problems much faster than existing classical algorithms. Yet, the quantum computer has been believed to be no more powerful than the most general computing model—the Turing machine. Undecidable problems, such as the halting problem, and unrecognizable inputs, such as the real numbers, are beyond the theoretical limit of the Turing machine. I suggest a model for a quantum computer, which is less general than the Turing machine, but may solve the halting problem for any task programmable on it. Moreover, inputs unrecognizable by the Turing machine can be recognized by the model, thus breaking the theoretical limit for a computational task. A quantum computer is not just a successful design of the Turing machine as it is widely perceived now, but is a different, less general but more powerful model for computing, the practical realization of which may need different strategies than those in use now.
Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not been fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example being the intrinsic infinite nature of any quantum computation. In this paper, we propose a definition of QTM, which extends and unifies the notions of Deutsch and Bernstein & Vazirani. In particular, we allow both arbitrary quantum input, and meaningful superpositions of computations, where some of them are “terminated” with an “output”, while others are not. For some infinite computations an “output” is obtained as a limit of finite portions of the computation. We propose a natural and robust observation protocol for our QTMs, which does not modify the probability of the possible outcomes of the machines. Finally, we use QTMs to define a class of quantum computable functions—any such function is a mapping from a general quantum state to a probability distribution of natural numbers. We expect that our class of functions, when restricted to classical input-output, will not be different from the set of the recursive functions.