Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/000416910/catalog> ?p ?o. }

• catalog alternative "Computability and unsolvability.".
• catalog contributor b494261.
• catalog created "1982.".
• catalog date "1982".
• catalog date "1982.".
• catalog dateCopyrighted "1982.".
• catalog description "Bibliography: p. 237-241.".
• catalog description "Introduction -- Heuristic remarks on decision problems -- Suggestions to the reader -- Notational conventions -- Part I. The General Yheory of Computability -- Computable functions -- Turing Machines -- Computable functions and partially computable functions -- Some examples -- Relatively computable functions -- Operations on computable functions -- Preliminary lemmas -- Composition and minimalization -- Recursive functions -- Some classes of functions -- Finite sequences of natural numbers -- Primitive recursion -- Primitive recursive functions -- Recursive sets and predicates -- Turing machines self-applied -- Arithmetization of the theory of turing machines -- Computability and recursiveness -- A universal turing machine -- Unsolvable decision problems -- Semicomputable predicates -- Decision problems -- Properties of semicomputable predicates -- Recursively enumerable sets -- Two recursively enumerable sets -- A set which is not recursively enumerable -- ".
• catalog description "Part 2. Applications of the General Theory -- Combinatorial problems -- Combinatorial systems -- Turing machines and semi-thue systems -- Thue systems -- The word problem for semigroups -- Normal systems and post systems -- Diophantine equations -- Hilbert's tenth problem -- Arithmetical and diophantine predicates -- Arithmetical representation of semicomputable predicates -- Mathematical logic -- Logics -- Incompleteness and unsolvability theorems for logics -- Arithmetical logics -- First-order logics -- Partial propositional calculi -- Part 3. Further Development of the General Theory -- The Kleene hierarchy -- The interation theorem -- Some first applications of the iteration theorem -- Predicates, sets, and functions -- Strong reducibility -- Some classes of predicates -- A representation theorem for P subscript 2 superscript A -- Post's representation theorem -- Computable functionals -- Functionals -- Complete computable functionals -- Normal form theorems -- ".
• catalog description "Partially computable and computable functionals -- Functionals and relative recursiveness -- Decision problems -- The recursion theorems -- The classification of unsolvable decision problems -- Reducibility and the Kleene hierarchy -- Incomparability -- Creative sets and simple sets -- Constructive ordinals -- Extensions of the Kleene hierarchy -- Appendix 1. Some results from the elementary theory of numbers -- Appendix 2. Hilbert's tenth problem is unsolvable.".
• catalog extent "xxv, 248 p. ;".
• catalog hasFormat "Computability & unsolvability.".
• catalog identifier "0486614719 (pbk.)".
• catalog isFormatOf "Computability & unsolvability.".
• catalog isPartOf "McGraw-Hill series in information processing and computers.".
• catalog issued "1982".
• catalog issued "1982.".
• catalog language "eng".
• catalog publisher "New York : Dover,".
• catalog relation "Computability & unsolvability.".
• catalog subject "Computable functions.".
• catalog subject "QA9.615 .D38 1982".
• catalog subject "Recursive functions.".
• catalog subject "Unsolvability (Mathematical logic)".
• catalog tableOfContents "Introduction -- Heuristic remarks on decision problems -- Suggestions to the reader -- Notational conventions -- Part I. The General Yheory of Computability -- Computable functions -- Turing Machines -- Computable functions and partially computable functions -- Some examples -- Relatively computable functions -- Operations on computable functions -- Preliminary lemmas -- Composition and minimalization -- Recursive functions -- Some classes of functions -- Finite sequences of natural numbers -- Primitive recursion -- Primitive recursive functions -- Recursive sets and predicates -- Turing machines self-applied -- Arithmetization of the theory of turing machines -- Computability and recursiveness -- A universal turing machine -- Unsolvable decision problems -- Semicomputable predicates -- Decision problems -- Properties of semicomputable predicates -- Recursively enumerable sets -- Two recursively enumerable sets -- A set which is not recursively enumerable -- ".
• catalog tableOfContents "Part 2. Applications of the General Theory -- Combinatorial problems -- Combinatorial systems -- Turing machines and semi-thue systems -- Thue systems -- The word problem for semigroups -- Normal systems and post systems -- Diophantine equations -- Hilbert's tenth problem -- Arithmetical and diophantine predicates -- Arithmetical representation of semicomputable predicates -- Mathematical logic -- Logics -- Incompleteness and unsolvability theorems for logics -- Arithmetical logics -- First-order logics -- Partial propositional calculi -- Part 3. Further Development of the General Theory -- The Kleene hierarchy -- The interation theorem -- Some first applications of the iteration theorem -- Predicates, sets, and functions -- Strong reducibility -- Some classes of predicates -- A representation theorem for P subscript 2 superscript A -- Post's representation theorem -- Computable functionals -- Functionals -- Complete computable functionals -- Normal form theorems -- ".
• catalog tableOfContents "Partially computable and computable functionals -- Functionals and relative recursiveness -- Decision problems -- The recursion theorems -- The classification of unsolvable decision problems -- Reducibility and the Kleene hierarchy -- Incomparability -- Creative sets and simple sets -- Constructive ordinals -- Extensions of the Kleene hierarchy -- Appendix 1. Some results from the elementary theory of numbers -- Appendix 2. Hilbert's tenth problem is unsolvable.".
• catalog title "Computability & unsolvability / Martin Davis.".
• catalog title "Computability and unsolvability.".
• catalog type "text".