scientific article; zbMATH DE number 225477

MaRDI QIDQ5286632zbMATH OpenFDO

Authors Paul E. Dunne

Publication date 1 July 1993

zbMATH Keywords

undecidabilitycomputabilityrecursive functionregister machinespost correspondence problemChurch-Turing hypothesisturing machinesMarkov algorithmsGödels's incompleteness theoremmatrix mortality problempost machinesRice theorems

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Recursively (computably) enumerable sets and degrees (03D25) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Recommendations

• Elementar computability theory
• scientific article; zbMATH DE number 530148
• Computability theory
• scientific article; zbMATH DE number 1955470

Cited in

(33)

• scientific article; zbMATH DE number 2150282 (Why is no real title available?)
• Limits of computation. From a programming perspective
• Computability theory
• Introduction to computability
• scientific article; zbMATH DE number 1955470 (Why is no real title available?)
• EAGLE start-up aid. Theory of computability. Cantor diagonalization, Gödelization, Turing machines
• Bounding homogenous models
• The settling-time reducibility ordering
• scientific article; zbMATH DE number 5194318 (Why is no real title available?)
• A characterization of the \(0\)-basis homogeneous bounding degrees
• Computability Results Used in Differential Geometry
• scientific article; zbMATH DE number 107969 (Why is no real title available?)
• scientific article; zbMATH DE number 4088936 (Why is no real title available?)
• The concept of computability
• scientific article; zbMATH DE number 1344905 (Why is no real title available?)
• Turing computability. Theory and applications
• A mathematical primer on computability
• The degree spectra of homogeneous models
• The complexity of agent design problems: Determinism and history dependence
• Computability. Models of computation and undecidability
• Introduction to algorithm theory
• Computable Models
• scientific article; zbMATH DE number 1560883 (Why is no real title available?)
• Computability and complexity theory.
• scientific article; zbMATH DE number 5778850 (Why is no real title available?)
• Models of computation. An introduction to computability theory
• Computability. Turing, Gödel, Church, and beyond
• The Foundations of Computability Theory
• Computability. Logic, reasoning, computer and Assembler, infinity, limits of automatizability. Textbook for class-room and self-study
• scientific article; zbMATH DE number 530148 (Why is no real title available?)
• Promptness does not imply superlow cuppability
• scientific article; zbMATH DE number 47306 (Why is no real title available?)
• The Foundations of Computability Theory

This page was built for publication:

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