scientific article; zbMATH DE number 225477

zbMATH Open0783.68002MaRDI QIDQ5286632FDOQ5286632

Authors: Paul E. Dunne 

Publication date: 1 July 1993

Title of this publication is not available (Why is that?)

Recommendations

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

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)

Cited In (33)

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