Mathematical and technological computability
From MaRDI portal
Recommendations
Cites work
- A notion of mechanistic theory
- An Unsolvable Problem of Elementary Number Theory
- Boole: from calculating numbers to calculating thoughts
- Church's thesis meets the \(N\)-body problem
- Computability and Incomputability
- Computability and Recursion
- Computation, hypercomputation, and physical science
- Computing with concepts, computing with numbers: Llull, Leibniz, and Boole
- Errors and Corrections in Mathematics Literature
- Finite combinatory processes—formulation
- From Logic to Physics: How the Meaning of Computation Changed over Time
- scientific article; zbMATH DE number 1189126 (Why is no real title available?)
- scientific article; zbMATH DE number 3661295 (Why is no real title available?)
- scientific article; zbMATH DE number 3728250 (Why is no real title available?)
- scientific article; zbMATH DE number 193560 (Why is no real title available?)
- scientific article; zbMATH DE number 727991 (Why is no real title available?)
- scientific article; zbMATH DE number 2000104 (Why is no real title available?)
- scientific article; zbMATH DE number 1549045 (Why is no real title available?)
- scientific article; zbMATH DE number 1865733 (Why is no real title available?)
- scientific article; zbMATH DE number 1869991 (Why is no real title available?)
- scientific article; zbMATH DE number 1869992 (Why is no real title available?)
- scientific article; zbMATH DE number 1870428 (Why is no real title available?)
- scientific article; zbMATH DE number 2118474 (Why is no real title available?)
- scientific article; zbMATH DE number 3220331 (Why is no real title available?)
- Hypercomputation and the Physical Church‐Turing Thesis
- Incompleteness, Mechanism, and Optimism
- Leibniz and the Calculus Ratiocinator
- Logical Approaches to Computational Barriers
- Mathematics and mechanical computation
- Off to infinity in finite time
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- On the algorithmic tradition in the history of mathematics
- Origins of Recursive Function Theory
- Physical computation. A mechanistic account
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Reflections on Church's thesis
- SAD computers and two versions of the Church-Turing thesis
- Special issue: Satisfiability in the year 2000
- Step by Recursive Step: Church's Analysis of Effective Calculability
- Three roots for Leibniz's contribution to the computational conception of reason
- Von Pasch zu Hilbert
- What Is the Lesson of Quantum Computing?
- Work for the Hairdressers: The Production of de Prony's Logarithmic and Trigonometric Tables
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Cited in
(6)- Observations on computability, uncertainty, and technology
- Games iteration numbers. A philosophical introduction to computability theory
- A roadmap for TAMC
- Physics and metaphysics look at computation
- Computational Non-universality: Philosophical and Artistic Perspectives
- Theoretical computer science: computability, decidability and logic
This page was built for publication: Mathematical and technological computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972862)
