Natural Argument by a Quantum Computer

Computing Methodology eJournal (Elsevier: SSRN) 3 (30):1-8 (2020)
  Copy   BIBTEX

Abstract

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.

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2020-08-21

Downloads
435 (#63,696)

6 months
94 (#61,972)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Vasil Penchev
Bulgarian Academy of Sciences

Citations of this work

No citations found.

Add more citations

References found in this work

The Problem of Hidden Variables in Quantum Mechanics.Simon Kochen & E. P. Specker - 1967 - Journal of Mathematics and Mechanics 17:59--87.

Add more references