scientific article; zbMATH DE number 225477

MaRDI QIDQ5286632zbMATH OpenFDO

Authors Paul E. Dunne

Publication date 1 July 1993

zbMATH Keywords

Church-Turing hypothesiscomputabilityGödels's incompleteness theoremMarkov algorithmsmatrix mortality problempost correspondence problempost machinesrecursive functionregister machinesRice theoremsturing machinesundecidability

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(35)

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