Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: P-COMPLETE GEOMETRIC PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log Depth Circuits for Division and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity with experiments as oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal computation and physical dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computations via Newtonian and relativistic kinematic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding infinitely parallel computation in Newtonian kinematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can Newtonian systems, bounded in space, time, mass and energy compute all functions? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental computation of real numbers by Newtonian machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5532570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3094765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graph recognition is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive mathematics and quantum physics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Division in logspace-uniform<i>NC</i><sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2702573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4805389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Real Turing Machines over Binary Inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum logic as motivated by quantum computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal background to mathematics. Ia, Ib: Logic, sets and numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Turing computations via Malament--Hogarth space-times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constructivist Perspective on Physics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of maximization and integration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conservative logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Church-Turing thesis: Still valid after all these years? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of \(O(n^ 2)\) problems in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definitions of computable real continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wave function of the Universe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Constructivism in Spacetime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5493748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithm for Hilbert's tenth problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Church's thesis and the ideal of informal rigour / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3704445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on real structural complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Approaches to Computational Barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5578545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unpredictability and undecidability in dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary black holes on a budget: simulations using workstations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2702574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The wave equation with computable initial data such that its unique solution is not computable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5200674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of N-body simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and complexity of ray tracing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical Mechanics as a Limit of Quantum Mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Church's thesis meets the \(N\)-body problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three counterexamples refuting Kieu's plan for ``quantum adiabatic hypercomputation''; and some uncomputable quantum mechanical tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The logical structure of mathematical physics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2702575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Linear'' chaos via paradoxical set decompositions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational universes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5493760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5448305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical physics and the Church--Turing Thesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Schrödinger propagators on type-2 Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of noncollision singularities in Newtonian systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of computation based on quantum logic. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational power of infinite quantum parallelism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effectively open real functions / rank
 
Normal rank

Latest revision as of 04:39, 2 July 2024

scientific article
Language Label Description Also known as
English
Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
scientific article

    Statements

    Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (English)
    0 references
    0 references
    13 November 2009
    0 references
    0 references
    Church-Turing hypothesis
    0 references
    structuralism in physics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references