scientific article

zbMath0536.03021MaRDI QIDQ3320351

Nigel J. Cutland

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computabilityGödel's incompleteness theorempartial recursive functionsregister machinesundecidable problemsKleene's recursion theoremsuniversal programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Undecidability and degrees of sets of sentences (03D35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (3)

Image of Soviet and Russian logic in the West. Latter Half of the XXth Century ⋮ Degree of unsolvability of the completeness problem in algebras of recursive functions ⋮ Specification of abstract dynamic-data types: A temporal logic approach

This page was built for publication: