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

computabilityEntscheidungsproblemHilbertTuring machine

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)

Review text

A polemic in which the philosopher author presumes to tell computer scientists what topics they ``would be better off focusing on. According to Cleland, computer scientists are woefully off-base about their own subject because ``Turing machines do not provide us with genuine procedures. The paper contains various other startling claims, such as that without real/complex analysis, abstract algebra would disappear.

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

• Hilbert's Programs: 1917–1922
• 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?)
• Hypercomputation: Philosophical issues
• Limiting recursion
• Trial and error predicates and the solution to a problem of Mostowski

Cited in

(13)

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

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)