Is the concept of computation a conceptual fixed point?

DOI10.1093/PHILMAT/NKAG005MaRDI QIDQ7315775zbMATH OpenFDO

Authors Paula Quinon

Publication date 18 August 2026

Published in Philosophia Mathematica. Series III (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/PHILMAT/NKAG005

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Philosophical and critical aspects of logic and foundations (03A05)

Cites work

• A taxonomy of deviant encodings
• Acceptable notation
• Actual and potential infinity
• Can Church's thesis be viewed as a Carnapian explication?
• Church's thesis after 70 years
• Church's thesis and physical computation
• Church's thesis and the conceptual analysis of computability
• Church's thesis and the ideal of informal rigour
• Computability and Recursion
• Computability, proof, and open-texture
• Forcing and the universe of sets: must we lose insight?
• scientific article; zbMATH DE number 3882394 (Why is no real title available?)
• scientific article; zbMATH DE number 3728250 (Why is no real title available?)
• scientific article; zbMATH DE number 107511 (Why is no real title available?)
• scientific article; zbMATH DE number 3521895 (Why is no real title available?)
• scientific article; zbMATH DE number 1869994 (Why is no real title available?)
• scientific article; zbMATH DE number 1390023 (Why is no real title available?)
• scientific article; zbMATH DE number 6308208 (Why is no real title available?)
• scientific article; zbMATH DE number 3051936 (Why is no real title available?)
• scientific article; zbMATH DE number 3060434 (Why is no real title available?)
• Mathematical Rigour and Informal Proof
• Models and computability
• Models and reality
• On algorithms, effective procedures, and their definitions
• On computable numbers, with an application to the Entscheidungsproblem.
• On formal and informal provability
• Physics and metaphysics look at computation
• Recantation or Any old ω-sequence would do after all
• Second thoughts about Church's thesis and mathematical proofs
• Step by Recursive Step: Church's Analysis of Effective Calculability
• The Church-Turing Thesis over Arbitrary Domains
• The Church-Turing thesis. A last vestige of a failed mathematical program
• Thin Objects
• Tractatus logico-philosophicus. With an introduction by B. Russell.
• Why Do We Prove Theorems?

This page was built for publication: Is the concept of computation a conceptual fixed point?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7315775)