Download PDFOpen PDF in browser

Natural Argument by a Quantum Computer

EasyChair Preprint no. 3819

8 pagesDate: July 12, 2020


Natural argument 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 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 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.

Keyphrases: infinite computation, Natural argument, quantum computer, quantum entanglement, quantum Turing machine, qubit

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
  author = {Vasil Penchev},
  title = {Natural Argument by a Quantum Computer},
  howpublished = {EasyChair Preprint no. 3819},

  year = {EasyChair, 2020}}
Download PDFOpen PDF in browser