Mathematical and Technological Computability
From MaRDI portal
Publication:4972862
DOI10.1007/978-3-319-93779-3_9zbMath1451.68012OpenAlexW2898431840MaRDI QIDQ4972862
Publication date: 27 November 2019
Published in: Philosophy of Engineering and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-93779-3_9
History of mathematical logic and foundations (03-03) Turing machines and related notions (03D10) History of computer science (68-03) General topics in the theory of computing (68Q01)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computation, hypercomputation, and physical science
- Reflections on Church's thesis
- A notion of mechanistic theory
- Von Pasch zu Hilbert
- Special issue: Satisfiability in the year 2000
- Church's thesis meets the \(N\)-body problem
- Errors and Corrections in Mathematics Literature
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- Physical Computation
- On the Algorithmic Tradition in the History of Mathematics
- Work for the Hairdressers: The Production of de Prony's Logarithmic and Trigonometric Tables
- Boole: From Calculating Numbers to Calculating Thoughts
- Three Roots for Leibniz’s Contribution to the Computational Conception of Reason
- Computing with Concepts, Computing with Numbers: Llull, Leibniz, and Boole
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Incompleteness, Mechanism, and Optimism
- Step by Recursive Step: Church's Analysis of Effective Calculability
- Hypercomputation and the Physical Church‐Turing Thesis
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
- Origins of Recursive Function Theory
- Leibniz and the Calculus Ratiocinator
- Mathematics and Mechanical Computation
- SAD Computers and Two Versions of the Church–Turing Thesis
- From Logic to Physics: How the Meaning of Computation Changed over Time
- Computability and Incomputability
- What Is the Lesson of Quantum Computing?
- Computability and Recursion
- An Unsolvable Problem of Elementary Number Theory
- Finite combinatory processes—formulation
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- Logical Approaches to Computational Barriers
This page was built for publication: Mathematical and Technological Computability
