Remarks on the development of computability

DOI10.1080/01445348308837055zbMATH Open0529.03015OpenAlexW2069157621WikidataQ58438143 ScholiaQ58438143MaRDI QIDQ3310596FDOQ3310596

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

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

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)