The concept of computability

DOI10.1016/j.tcs.2003.12.012zbMath1050.03028OpenAlexW2134221647MaRDI QIDQ1434377

Carol E. Cleland

Publication date: 4 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.12.012

zbMATH Keywords

HilbertTuring machinecomputabilityEntscheidungsproblem

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10)

Related Items (3)

The case for hypercomputation ⋮ How much can analog and hybrid systems be proved (super-)Turing ⋮ Algorithmic measurement procedures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypercomputation: Philosophical issues
• Hilbert's Programs: 1917–1922
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion

This page was built for publication: The concept of computability