Natural Argument by a Quantum Computer

Vasil Dinev Penchev

Published Jan 1, 2020• 0 citations

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, 20200 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, 20200 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, 20200 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, 20140 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 ReportsJul 1, 20203 citations

A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory

Vasil Dinev Penchev

A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in Section I.Many modifications of Turing machines cum quantum ones are researched in Section II for the Halting problem and completeness, and the model of two independent Turing machines seems to generalize them.Then, that pair can be postulated as the formal definition of reality therefore being complete unlike any of them standalone, remaining incomplete without its complementary counterpart. Representation is formal defined as a one-to-one mapping between the two Turing machines, and the set of all those mappings can be considered as “language” therefore including metaphors as mappings different than representation. Section III investigates that formal relation of “reality”, “representation”, and “language” modeled by (at least two) Turing machines.The independence of (two) Turing machines is interpreted by means of game theory and especially of the Nash equilibrium in Section IV.Choice and information as the quantity of choices are involved. That approach seems to be equivalent to that based on set theory and the concept of actual infinity in mathematics and allowing of practical implementations.

Jan 1, 20202 citations