相关论文: The G\"odelizing Quantum-Mechanical Automata

It is shown that the Einstein-Podolsky-Rosen conclusion concerning the `incompleteness' of Quantum Mechanics is invalidated by two logical errors in their argument. If it were possible to perform the proposed gedanken experiment it would,…

A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages which is closed under boolean operations…

The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a deductive system, rather than a particular algorithm, captures the formal reasoning used by…

When used as verifiers in Arthur-Merlin systems, two-way quantum finite automata can verify membership in all languages with bounded error with double-exponential expected running time, which cannot be achieved by their classical…

The Einstein, Podolski and Rosen (EPR) argument aiming to prove the incompleteness of quantum mechanics (QM) was opposed by most EPR's contemporary physicists and is not accepted within the standard interpretation of QM, which maintains…

If we apply an extension of the Deduction meta-Theorem to Goedel's meta-reasoning of "undecidability", we can conclude that Goedel's formal system of Arithmetic is not omega-consistent. If we then take the standard interpretation…

Building on the seminal work of Gromov on endomorphisms of symbolic algebraic varieties [10], we introduce a notion of cellular automata over schemes which generalize affine algebraic cellular automata in [7]. We extend known results to…

Scholars of the history and philosophy of science have asked what would decolonized science would look like. This paper develops an answer by interrogating the assumption that observations need to be recorded and communicated using the…

The paper attempts to convince that the orthodox interpretation of quantum mechanics does not contradict philosophical realism by throwing light onto certain properties of quantum systems that seem to have escaped attention as yet. The…

The famous G\"odel incompleteness theorem says that for every sufficiently rich formal theory (containing formal arithmetic in some natural sense) there exist true unprovable statements. Such statements would be natural candidates for being…

An out of the box intellectual path exploring the foundations of quantum mechanics is discussed in some detail, in order to clarify why a possibly different way to look at the relevant fundamental questions can be identified and can support…

After the first treatments of quantum finite state automata by Moore and Crutchfield and by Kondacs and Watrous, a number of papers study the power of quantum finite state automata and their variants. This paper introduces a model of…

It is argued that the usual postulates of quantum mechanics are too strong. It is conjectured that it is possible to interpret all experiments if we maintain the formalism of quantum theory without modification, but weaken the postulates…

The Einstein-Podolsky-Rosen argument on quantum mechanics incompleteness is formulated in terms of elements of reality inferred from joint (as opposed to alternative) measurements, in two examples involving entangled states of three…

We provide a systematic approach to quantum mechanics from an information-theoretic perspective using the language of tensor networks. Our formulation needs only a single kind of object, so-called positive *-tensors. Physical models…

The paper reviews and discusses four ideas scattered in previous papers of the author. First, objective properties of quantum systems are not associated with observables but are defined by preparations. Second, measurable results of…

In this paper, a modified formulation of generalized probabilistic theories that will always give rise to the structure of Hilbert space of quantum mechanics, in any finite outcome space, is presented and the guidelines to how to extend…

The set-theoretical model of Goedel's system T is not fully abstract. We also briefly discuss fully abstract models of system T.

A new simple proof of the adiabatic theorem is given in the finite dimensional case for nondegenerate as well as degenerate states. The explicitly integrable two level system is considered as an example. It is demonstrated that the error…

Hilbert and Ackermann asked for a method to consistently extend incomplete theories to complete theories. G\"odel essentially proved that any theory capable of encoding its own statements and their proofs contains statements that are true…