Matches in Harvard for { <http://id.lib.harvard.edu/aleph/007434274/catalog> ?p ?o. }
Showing items 1 to 21 of
21
with 100 items per page.
- catalog contributor b10262451.
- catalog created "c1997.".
- catalog date "1997".
- catalog date "c1997.".
- catalog dateCopyrighted "c1997.".
- catalog description "Includes bibliographical references (p. [447]-455] and index.".
- catalog description "Introduction -- The WHILE language -- Programs as data objects -- Self-interpretation: universal programs for WHILE and I -- Elements of computability theory -- Metaprogramming, self-application, and compiler generation -- Other sequential models of computation -- Robustness of computability -- Computability by functional languages (partly by T.Æ. Mogensen) -- Some natural unsolvable problems -- Hilbert's tenth problem (by M.H. Sorensen) -- Inference systems and Gödel's incompleteness theorem -- Computability theory based on numbers -- More abstract approaches to computability -- Overview of complexity theory -- Measuring time usage -- Time usage of tree-manipulating programs -- Robustness of time-bounded computation -- Linear and other time hierarchies for WHILE programs -- The existence of optimal algorithms (by A.M. Ben-Amram) -- Space-bounded computations -- Nondeterministic computations -- A structure for classifying the complexity of various problems -- Characterizations of LOGSPACE and PTIME by GOTO programs -- Completeness and reduction of one problem to another -- Complete problems for PTIME -- Complete problems for NPTIME -- Complete problems for PSPACE -- A mathematical terminology and concepts.".
- catalog extent "xvi, 466 p. ;".
- catalog identifier "0262100649 (alk. paper)".
- catalog isPartOf "Foundations of computing".
- catalog issued "1997".
- catalog issued "c1997.".
- catalog language "eng".
- catalog publisher "Cambridge, Mass. : MIT Press,".
- catalog subject "005.13/1 21".
- catalog subject "Computational complexity.".
- catalog subject "Computer programming.".
- catalog subject "QA76.6 .J6658 1997".
- catalog tableOfContents "Introduction -- The WHILE language -- Programs as data objects -- Self-interpretation: universal programs for WHILE and I -- Elements of computability theory -- Metaprogramming, self-application, and compiler generation -- Other sequential models of computation -- Robustness of computability -- Computability by functional languages (partly by T.Æ. Mogensen) -- Some natural unsolvable problems -- Hilbert's tenth problem (by M.H. Sorensen) -- Inference systems and Gödel's incompleteness theorem -- Computability theory based on numbers -- More abstract approaches to computability -- Overview of complexity theory -- Measuring time usage -- Time usage of tree-manipulating programs -- Robustness of time-bounded computation -- Linear and other time hierarchies for WHILE programs -- The existence of optimal algorithms (by A.M. Ben-Amram) -- Space-bounded computations -- Nondeterministic computations -- A structure for classifying the complexity of various problems -- Characterizations of LOGSPACE and PTIME by GOTO programs -- Completeness and reduction of one problem to another -- Complete problems for PTIME -- Complete problems for NPTIME -- Complete problems for PSPACE -- A mathematical terminology and concepts.".
- catalog title "Computability and complexity : from a programming perspective / Neil D. Jones.".
- catalog type "text".