Natural Argument by a Quantum Computer

Download Edit this record How to cite View on PhilPapers
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.
PhilPapers/Archive ID
PENNAB
Upload history
Archival date: 2020-08-21
View other versions
Added to PP index
2020-08-21

Total views
149 ( #43,413 of 71,281 )

Recent downloads (6 months)
21 ( #37,935 of 71,281 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.