scientific article; zbMATH DE number 3922632

zbMATH Open0577.03018MaRDI QIDQ3698786FDOQ3698786

Authors: George Tourlakis 

Publication date: 1984

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

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

zbMATH Keywords

unsolvabilityrecursive functionscreativityComplexityChurch's ThesisNondeterminismrecursion theoremsMachinesReducibilityproductivenessGödel's incompleteness theoremArithmetizationEffective enumerabilityRecursivenessRelativized computability

Mathematics Subject Classification ID

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

Cited In (21)

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

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)