28,534 research outputs found
Machines, Logic and Quantum Physics
Though the truths of logic and pure mathematics are objective and independent
of any contingent facts or laws of nature, our knowledge of these truths
depends entirely on our knowledge of the laws of physics. Recent progress in
the quantum theory of computation has provided practical instances of this, and
forces us to abandon the classical view that computation, and hence
mathematical proof, are purely logical notions independent of that of
computation as a physical process. Henceforward, a proof must be regarded not
as an abstract object or process but as a physical process, a species of
computation, whose scope and reliability depend on our knowledge of the physics
of the computer concerned.Comment: 19 pages, 8 figure
âFuzzy timeâ, from paradox to paradox (Does it solve the contradiction between Quantum Mechanics & General Relativity?)
Although Fuzzy logic and Fuzzy Mathematics is a widespread subject and there is a vast literature about it, yet the use of Fuzzy issues like Fuzzy sets and Fuzzy numbers was relatively rare in time concept. This could be seen in the Fuzzy time series. In addition, some attempts are done in fuzzing Turing Machines but seemingly there is no need to fuzzy time. Throughout this article, we try to change this picture and show why it is helpful to consider the instants of time as Fuzzy numbers. In physics, though there are revolutionary ideas on the time concept like B theories in contrast to A theory also about central concepts like space, momentum⊠it is a long time that these concepts are changed, but time is considered classically in all well-known and established physics theories. Seemingly, we stick to the classical time concept in all fields of science and we have a vast inertia to change it. Our goal in this article is to provide some bases why it is rational and reasonable to change and modify this picture. Here, the central point is the modified version of âUnexpected Hangingâ paradox as it is described in "Is classical Mathematics appropriate for theory of Computation".This modified version leads us to a contradiction and based on that it is presented there why some problems in Theory of Computation are not solved yet. To resolve the difficulties arising there, we have two choices. Either âchoosingâ a new type of Logic like âPara-consistent Logicâ to tolerate contradiction or changing and improving the time concept and consequently to modify the âTuring Computational Modelâ. Throughout this paper, we select the second way for benefiting from saving some aspects of Classical Logic. In chapter 2, by applying quantum Mechanics and Schrodinger equation we compute the associated fuzzy number to time. These, provides a new interpretation of Quantum Mechanics.More exactly what we see here is "Particle-Fuzzy time" interpretation of quantum Mechanics, in contrast to some other interpretations of Quantum Mechanics like " Wave-Particle" interpretation.
At the end, we propound a question about the possible solution of a paradox in Physics, the contradiction between General Relativity and Quantum Mechanics
The universe as quantum computer
This article reviews the history of digital computation, and investigates
just how far the concept of computation can be taken. In particular, I address
the question of whether the universe itself is in fact a giant computer, and if
so, just what kind of computer it is. I will show that the universe can be
regarded as a giant quantum computer. The quantum computational model of the
universe explains a variety of observed phenomena not encompassed by the
ordinary laws of physics. In particular, the model shows that the the quantum
computational universe automatically gives rise to a mix of randomness and
order, and to both simple and complex systems.Comment: 16 pages, LaTe
Zeno machines and hypercomputation
This paper reviews the Church-Turing Thesis (or rather, theses) with
reference to their origin and application and considers some models of
"hypercomputation", concentrating on perhaps the most straight-forward option:
Zeno machines (Turing machines with accelerating clock). The halting problem is
briefly discussed in a general context and the suggestion that it is an
inevitable companion of any reasonable computational model is emphasised. It is
hinted that claims to have "broken the Turing barrier" could be toned down and
that the important and well-founded role of Turing computability in the
mathematical sciences stands unchallenged.Comment: 11 pages. First submitted in December 2004, substantially revised in
July and in November 2005. To appear in Theoretical Computer Scienc
Non-classical computing: feasible versus infeasible
Physics sets certain limits on what is and is not computable. These limits are very far from having been reached by current technologies. Whilst proposals for hypercomputation are almost certainly infeasible, there are a number of non classical approaches that do hold considerable promise. There are a range of possible architectures that could be implemented on silicon that are distinctly different from the von Neumann model. Beyond this, quantum simulators, which are the quantum equivalent of analogue computers, may be constructable in the near future
Turing machines based on unsharp quantum logic
In this paper, we consider Turing machines based on unsharp quantum logic.
For a lattice-ordered quantum multiple-valued (MV) algebra E, we introduce
E-valued non-deterministic Turing machines (ENTMs) and E-valued deterministic
Turing machines (EDTMs). We discuss different E-valued recursively enumerable
languages from width-first and depth-first recognition. We find that
width-first recognition is equal to or less than depth-first recognition in
general. The equivalence requires an underlying E value lattice to degenerate
into an MV algebra. We also study variants of ENTMs. ENTMs with a classical
initial state and ENTMs with a classical final state have the same power as
ENTMs with quantum initial and final states. In particular, the latter can be
simulated by ENTMs with classical transitions under a certain condition. Using
these findings, we prove that ENTMs are not equivalent to EDTMs and that ENTMs
are more powerful than EDTMs. This is a notable difference from the classical
Turing machines.Comment: In Proceedings QPL 2011, arXiv:1210.029
Towards Quantifying Complexity with Quantum Mechanics
While we have intuitive notions of structure and complexity, the
formalization of this intuition is non-trivial. The statistical complexity is a
popular candidate. It is based on the idea that the complexity of a process can
be quantified by the complexity of its simplest mathematical model - the model
that requires the least past information for optimal future prediction. Here we
review how such models, known as -machines can be further simplified
through quantum logic, and explore the resulting consequences for understanding
complexity. In particular, we propose a new measure of complexity based on
quantum -machines. We apply this to a simple system undergoing
constant thermalization. The resulting quantum measure of complexity aligns
more closely with our intuition of how complexity should behave.Comment: 10 pages, 6 figure, Published in the Focus Point on Quantum
information and complexity edition of EPJ Plu
- âŠ