The concept of computability

DOI10.1016/J.TCS.2003.12.012MaRDI QIDQ1434377zbMATH OpenOpenAlexFDO

Authors 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

Turing machinecomputabilityHilbertEntscheidungsproblem

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)

Recommendations

• scientific article; zbMATH DE number 3987247
• Computability
• scientific article; zbMATH DE number 3922632
• scientific article; zbMATH DE number 5810075
• scientific article; zbMATH DE number 1061261
• Computability and Incomputability
• scientific article; zbMATH DE number 225477
• Computability and Definability

Cites work

• scientific article; zbMATH DE number 3924764 (Why is no real title available?)
• scientific article; zbMATH DE number 3728250 (Why is no real title available?)
• scientific article; zbMATH DE number 4128774 (Why is no real title available?)
• scientific article; zbMATH DE number 1869991 (Why is no real title available?)
• scientific article; zbMATH DE number 1869994 (Why is no real title available?)
• scientific article; zbMATH DE number 1869996 (Why is no real title available?)
• scientific article; zbMATH DE number 1869997 (Why is no real title available?)
• scientific article; zbMATH DE number 1870122 (Why is no real title available?)
• Hilbert's Programs: 1917–1922
• Hypercomputation: Philosophical issues
• Limiting recursion
• Trial and error predicates and the solution to a problem of Mostowski

Cited in

(11)

• Algorithmic measurement procedures
• Hypercomputation: fantasy or reality? A position paper
• Computability theory
• The mathematician's bias -- and the return to embodied computation
• A roadmap for TAMC
• How much can analog and hybrid systems be proved (super-)Turing
• Mathematical and technological computability
• From Descartes to Turing: the computational content of supervenience
• The case for hypercomputation
• Superintelligence cannot be contained: lessons from computability theory
• scientific article; zbMATH DE number 1869993 (Why is no real title available?)

This page was built for publication: The concept of computability

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