scientific article; zbMATH DE number 3922632

MaRDI QIDQ3698786zbMATH OpenFDO

Authors George Tourlakis

Publication date 1984

zbMATH Keywords

ArithmetizationChurch's ThesisComplexitycreativityEffective enumerabilityGödel's incompleteness theoremMachinesNondeterminismproductivenessrecursion theoremsrecursive functionsRecursivenessReducibilityRelativized computabilityunsolvability

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Undecidability and degrees of sets of sentences (03D35) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory (03Dxx)

Recommendations

• scientific article; zbMATH DE number 5778850
• Computability
• scientific article; zbMATH DE number 480999
• scientific article; zbMATH DE number 43713
• scientific article; zbMATH DE number 1880324

Cited in

(22)

• The influence of domain interpretations on computational models
• An inductive number-theoretic characterization of NP
• Maschinen, Intelligenz und Selbstbezüglichkeit - Gedanken zu einem Bestseller
• Termination of rewriting
• Recursive functions and metamathematics. Problems of completeness and decidability, Gödel's theorems
• Bounded linear logic: A modular approach to polynomial-time computability
• Weights for total division orderings on strings
• McNaughton families of languages.
• The concept of computability
• Computability and human symbolic output
• A formalization of polytime functions
• EAGLE start-up aid. Theory of computability. Cantor diagonalization, Gödelization, Turing machines
• scientific article; zbMATH DE number 3165537 (Why is no real title available?)
• Computability in Specification
• scientific article; zbMATH DE number 5354044 (Why is no real title available?)
• scientific article; zbMATH DE number 4088936 (Why is no real title available?)
• scientific article; zbMATH DE number 43713 (Why is no real title available?)
• scientific article; zbMATH DE number 1285742 (Why is no real title available?)
• scientific article; zbMATH DE number 1880324 (Why is no real title available?)
• Encoding the factorisation calculus
• Computability
• A mechanisation of computability theory in HOL

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 Q3698786)