A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory
@article{Penchev2020AMM,
title={A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory},
author={Vasil Penchev},
journal={PRN: Philosophy of Mathematics \& Logic (Topic)},
year={2020}
}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 Godel 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…
One Citation
The homeomorphism of Minkowski space and the separable complex Hilbert space: the physical, mathematical and philosophical interpretations
- Mathematics
- 2021
A homeomorphism is built between the separable complex Hilbert space and Minkowski space by meditation of quantum information. That homeomorphism can be interpreted physically as the invariance to a…
References
SHOWING 1-10 OF 118 REFERENCES
Models of Quantum Turing Machines
- Physics
- 1998
Quantum Turing machines are discussed and reviewed in this paper. Most of the paper is concerned with processes defined by a step operator T that is used to construct a Hamiltonian H according to…
Quantum theory, the Church–Turing principle and the universal quantum computer
- Physics, PhilosophyProceedings of the Royal Society of London. A. Mathematical and Physical Sciences
- 1985
It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every finitely realizible…
Machines, logic and quantum physics
- PhilosophyBull. Symb. Log.
- 2000
Galileo's introduction of mathematically formulated, testable theories into physics marked the transition from the Aristotelian conception of physics to its modern status as a theoretical, conjectural and empirical science.
The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Physics
- 1980
In this paper a microscopic quantum mechanical model of computers as represented by Turing machines is constructed. It is shown that for each numberN and Turing machineQ there exists a HamiltonianHNQ…
Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
- MathematicsQuantum Inf. Process.
- 2009
The class of finitely generated uniform QCFs is perfectly equivalent to the class of polynomial-time QTMs and can exactly simulate each other; this naturally implies that BQP as well as ZQP and EQP equal the corresponding complexity classes of the finitely generate uniform Q CFs.
Construction theory, self-replication, and the halting problem
- Computer Science
- 2008
It is argued that self-replication of von Neumann's universal constructors holds a close similarity to circular computational processes of universal computers that appear in Turing's original proof of the undecidability of the halting problem.
Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality
- Computer ScienceFCT
- 1993
A new criterion, namely the number of colours used by the instructions of a Turing machine program, is proposed to settle the frontier between a decidable halting problem and universality for Turing…
Infinite Time Turing Machines With Only One Tape
- MathematicsMath. Log. Q.
- 2001
There are infinite time computable functions f:R-->R that are not one-tape computable, and so the two models of supertask computation are not equivalent; but closing it under composition yields the full class of all infinite time computation functions.
The Uniform Halting Problem for Generalized One State Turing Machines
- MathematicsSWAT
- 1968
This paper finds that the UH for one state TM's with two dimensional tape and jumping reading head and with two or more reading heads on the same tape have an unsolvable UH.