The dependence of computability on numerical notations

DOI10.1007/s11229-020-02732-xzbMath1525.03100OpenAlexW3035972762MaRDI QIDQ6088491

Ethan Brauer

Publication date: 14 December 2023

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11229-020-02732-x

zbMATH Keywords

computabilityChurch-Turing thesiscomputable semanticsacceptable notationdeviant encoding

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Classical models of computation (Turing machines, etc.) (68Q04)

Cites Work

• On the possibility of supertasks in general relativity
• Acceptable notation
• Church's thesis and the conceptual analysis of computability
• Gödel's Disjunction
• The Representational Foundations of Computation
• Towards a Definition of an Algorithm
• A Real Number Structure that is Effectively Categorical
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Building Infinite Machines
• Deciding Arithmetic Using SAD Computers
• Skepticism of quantum computing
• Computing with Numbers and Other Non-syntactic Things: De re Knowledge of Abstract Objects†
• The Extent of Computation in Malament–Hogarth Spacetimes
• Computational Complexity
• 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
• Unnamed Item

This page was built for publication: The dependence of computability on numerical notations