中文
相关论文

相关论文: Is a deterministic universe logically consistent w…

200 篇论文

The complexity class $NP$ can be logically characterized both through existential second order logic $SO\exists$, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as…

逻辑 · 数学 2014-10-21 Tuomo Kauranne

We analyse an argument of Deutsch, which purports to show that the deterministic part of classical quantum theory together with deterministic axioms of classical decision theory, together imply that a rational decision maker behaves as if…

量子物理 · 物理学 2007-05-23 Richard D. Gill

Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits infinite parallelism and the infinitely precise specification of states, a negative answer to both questions is not…

量子物理 · 物理学 2009-11-13 R. Srikanth

We give a precise definition of a formal mathematical object as any symbol for an individual constant, predicate letter, or a function letter that can be introduced through definition into a formal mathematical language without inviting…

综合数学 · 数学 2007-05-23 Bhupinder Singh Anand

We define a subclass of quantum Turing machine (QTM) named SR-QTM, which halts deterministically and has deterministic tape head position. A quantum state transition diagram (QSTD) is proposed to describe SR-QTM. With the help of QSTD, we…

量子物理 · 物理学 2012-03-01 Min Liang , Li Yang

I shall argue that a resolution of the PvNP problem requires building an iff bridge between the domain of provability and that of computability. The former concerns how a human intelligence decides the truth of number-theoretic relations,…

综合数学 · 数学 2010-06-23 Bhupinder Singh Anand

We prove that there is no algorithm to tell whether an arbitrarily constructed Quantum Turing Machine has same time steps for different branches of computation. We, hence, can not avoid the notion of halting to be probabilistic in Quantum…

量子物理 · 物理学 2007-05-23 Takayuki Miyadera , Masanori Ohya

A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective…

逻辑 · 数学 2018-03-20 A. Sernadas , J. Rasga , C. Sernadas , L. Alcácer , A. B. Henriques

Quantum mechanics is a fundamentally probabilistic theory (at least so far as the empirical predictions are concerned). It follows that, if one wants to properly understand quantum mechanics, it is essential to clearly understand the…

量子物理 · 物理学 2009-11-10 D. M. Appleby

Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not being fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example…

计算机科学中的逻辑 · 计算机科学 2020-08-13 Stefano Guerrini , Simone Martini , Andrea Masini

We consider how to define a natural probability distribution over worlds within a simple class of deterministic many-worlds theories. This can help us understand the typical properties of worlds within such states, and hence explain the…

量子物理 · 物理学 2023-04-12 Anthony J. Short

We present an original model of paraconsistent Turing machines (PTMs), a generalization of the classical Turing machines model of computation using a paraconsistent logic. Next, we briefl y describe the standard models of quantum…

量子物理 · 物理学 2007-05-23 Juan C. Agudelo , Walter Carnielli

It is argued that any possible definition of a realistic physics theory -- i.e., a mathematical model representing the real world -- cannot be considered comprehensive unless it is supplemented with requirement of being computationally…

量子物理 · 物理学 2015-01-27 Arkady Bolotin

I offer an account of how the quantum theory we have helps us explain so much. The account depends on a pragmatist interpretation of the theory: This takes a quantum state to serve solely as a source of sound advice to physically situated…

物理学史与哲学 · 物理学 2016-01-06 Richard Healey

The power of real-time Turing machines using sublinear space is investigated. In contrast to a claim appearing in the literature, such machines can accept non-regular languages, even if working in deterministic mode. While maintaining a…

计算复杂性 · 计算机科学 2019-02-05 Holger Petersen

Quantum theory is formulated as the uniquely consistent way to manipulate probability amplitudes. The crucial ingredient is a consistency constraint: if the amplitude of a quantum process can be computed in two different ways, the two…

量子物理 · 物理学 2009-10-31 Ariel Caticha

A version of quantum theory is derived from a set of plausible assumptions related to the following general setting: For a given system there is a set of experiments that can be performed, and for each such experiment an ordinary…

量子物理 · 物理学 2012-07-10 Inge S. Helland

Bohmian mechanics represents the universe as a set of paths with a probability measure defined on it. The way in which a mathematical model of this kind can explain the observed phenomena of the universe is examined in general. It is shown…

量子物理 · 物理学 2007-11-20 Bruno Galvan

A quantum theory of the universe consists of a theory of its quantum dynamics and a theory of its quantum state The theory predicts quantum multiverses in the form of decoherent sets of alternative histories describing the evolution of the…

广义相对论与量子宇宙学 · 物理学 2018-01-29 James B. Hartle

If there exists a classical, i.e. deterministic theory underlying quantum mechanics, an explanation must be found of the fact that the Hamiltonian, which is defined to be the operator that generates evolution in time, is bounded from below.…

量子物理 · 物理学 2009-11-13 Gerard 't Hooft