Remarks on the development of computability

DOI10.1080/01445348308837055MaRDI QIDQ3310596zbMATH OpenOpenAlexWikidataFDO

Authors Stewart Shapiro

Publication date 1983

Published in History and Philosophy of Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01445348308837055

zbMATH Keywords

computability theoryChurch's thesisHilbert programalgorithmic notionsGoedel's incompleteness theoremuniversal algorithmic languages

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites work

• scientific article; zbMATH DE number 3122413 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3291139 (Why is no real title available?)
• Algebra and logic. Papers from the 1974 Summer Research Institute of the Australian Mathematical Society, Monash University, Australia
• An Unsolvable Problem of Elementary Number Theory
• Finite combinatory processes—formulation
• General recursive functions of natural numbers
• Mechanism, mentalism, and metamathematics. An essay on finitism
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On notation for ordinal numbers
• On some recent criticism of Church's thesis
• Recursively enumerable sets of positive integers and their decision problems
• String theory
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I

This page was built for publication: Remarks on the development of computability

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