The significance of relativistic computation for the philosophy of mathematics
From MaRDI portal
(Redirected from Publication:5015969)
Recommendations
- Towards formal verification of computations and hypercomputations in relativistic physics
- Computational complexity theory and the philosophy of mathematics
- Theory of quantum computation and philosophy of mathematics. II
- General relativistic hypercomputing and foundation of mathematics
- Hypercomputation: Philosophical issues
Cites work
- A computable ordinary differential equation which possesses no computable solution
- A note on `Einstein's special relativity beyond the speed of light by James M. Hill and Barry J. Cox'
- A notion of mechanistic theory
- A proof of the Kepler conjecture
- A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer
- A Universal Ordinary Differential Equation
- Alan Turing: Life and Legacy of a Great Thinker
- Cannonballs and honeycombs.
- Closed timelike curves in relativistic computation
- Decidability, undecidability, and Gödel's incompleteness in relativity theories
- Defending the axioms. On the philosophical foundations of set theory
- Definitions by abstraction in the Peano school
- Does mathematics need new axioms?
- Energy conservation and supertasks
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Existence of faster than light signals implies hypercomputation already in special relativity
- General relativistic hypercomputing and foundation of mathematics
- Gödel's square axioms for the continuum
- Gödel's way. Exploits into an undecidable world
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3145185 (Why is no real title available?)
- scientific article; zbMATH DE number 5505771 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 1260390 (Why is no real title available?)
- scientific article; zbMATH DE number 1329018 (Why is no real title available?)
- scientific article; zbMATH DE number 1163917 (Why is no real title available?)
- scientific article; zbMATH DE number 1869997 (Why is no real title available?)
- scientific article; zbMATH DE number 1909822 (Why is no real title available?)
- scientific article; zbMATH DE number 1909823 (Why is no real title available?)
- scientific article; zbMATH DE number 1909824 (Why is no real title available?)
- scientific article; zbMATH DE number 1909827 (Why is no real title available?)
- scientific article; zbMATH DE number 1909830 (Why is no real title available?)
- scientific article; zbMATH DE number 1909831 (Why is no real title available?)
- scientific article; zbMATH DE number 3237808 (Why is no real title available?)
- Hypercomputation
- Hypercomputation and the Physical Church‐Turing Thesis
- Hypercomputation: Philosophical issues
- Indexing and mathematical explanation
- Infinite time Turing machines
- Is Cantor's Continuum Problem Inherently Vague?
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- Logical analysis of relativity theories
- Machines, Logic and Quantum Physics
- Mathematical Explanation in Science
- Mathematical explanation: problems and prospects.
- Mathematical inference and logical inference
- Meaning, Truth, and Physics
- Measurable cardinals and the continuum hypothesis
- Non-Turing computations via Malament--Hogarth space-times
- On the epistemological significance of the Hungarian project
- Optimisation and mathematical explanation: doing the Lévy walk
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Powers of regular cardinals
- Predicting the future in relativistic spacetimes
- Quantum algorithm for Hilbert's tenth problem
- Quantum speedup of Monte Carlo methods
- Relativistic computers and the Turing barrier
- Subsystems of second order arithmetic
- The axiom of determinacy, forcing axioms, and the nonstationary ideal
- The case for hypercomputation
- The continuum hypothesis. II.
- The Explanatory Power of Phase Spaces
- The Extent of Computation in Malament–Hogarth Spacetimes
- The hyperuniverse program
- The phenomenology of mathematical proof
- The physical Church-Turing thesis: modest or bold?
- The set-theoretic multiverse
- The wave equation with computable initial data such that its unique solution is not computable
- The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
- Theory of quantum computation and philosophy of mathematics. I
- Theory of quantum computation and philosophy of mathematics. II
- Three counterexamples refuting Kieu's plan for ``quantum adiabatic hypercomputation; and some uncomputable quantum mechanical tasks
- Undecidability and incompleteness in classical mechanics
- Undecidable diophantine equations
- Using Mathematics to Explain a Scientific Theory
- What algebraic properties of quantities are needed to model accelerated observers in relativity theory
- What makes a scientific explanation distinctively mathematical?
- Why Do Mathematicians Re-prove Theorems?
- Why Do We Prove Theorems?
- Why there is no such discipline as hypercomputation
Cited in
(2)
This page was built for publication: The significance of relativistic computation for the philosophy of mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015969)
