scientific article; zbMATH DE number 225477
From MaRDI portal
Publication:5286632
zbMath0783.68002MaRDI QIDQ5286632
Publication date: 1 July 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
undecidabilitypost correspondence problemcomputabilityrecursive functionregister machinesChurch-Turing hypothesisturing machinesMarkov algorithmsGödels's incompleteness theoremmatrix mortality problempost machinesRice theorems
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10)
Related Items
The settling-time reducibility ordering ⋮ A characterization of the 0-basis homogeneous bounding degrees ⋮ The complexity of agent design problems: Determinism and history dependence ⋮ The degree spectra of homogeneous models ⋮ Promptness does not imply superlow cuppability ⋮ Computability Results Used in Differential Geometry ⋮ Bounding homogenous models
This page was built for publication: