Data Portal @ linkeddatafragments.org

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

• catalog contributor b2589739.
• catalog created "c1989.".
• catalog date "1989".
• catalog date "c1989.".
• catalog dateCopyrighted "c1989.".
• catalog description "Algorithms: cooking up programs -- Finite automata: the black box -- Systems of logic: boolean bases -- Simulation: the Monte Carlo method -- Gödel's theorem: limits on logic -- Game trees: the minimax method -- The Chomsky hierarchy: four computers -- Random numbers: the Chaitin-Kolmogoroff theory -- Program correctness: ultimate debugging -- Search trees: traversal and maintenance -- Error-correcting codes: pictures from space -- Boolean logic: expressions and circuits -- Regular languages: pumping words -- Time and space complexity: the big-O notation -- The random access machine: an abstract computer -- Spline curves: smooth interpolation -- Computer vision: polyhedral scenes -- Karnaugh maps: circuit minimization -- Minimum spanning trees: a fast algorithm -- Generative grammars: Lindenmeyer systems".
• catalog description "Cellular automata: the game of life -- Cook's theorem: nuts and bolts -- Self-replicating computers: Codd's machine -- Storing images: a cat in a quad tree -- The scram: a simplified computer -- Shannon's theory: the elusive codes -- Detecting primes: an algorithm that almost always works -- Universal turing machines: computers as programs -- Text compression: Huffman coding -- NP-complete problems: the tree of intractability -- Iteration and recursion: the towers of Hanoi -- VSLI computers: circuits in silicon -- Linear programming: the simplex method -- Predicate calculus: the resolution method -- The halting problem: the uncomputable -- Searching strings: the Boyer-Moore algorithm -- Parallel computing: processors with connections -- The word problem: dictionaries as programs -- Logic programming: prologue to an expert system -- Church's thesis: all computers are created equal -- Relational data bases: do-it-yourself queries.".
• catalog description "Includes bibliographical references.".
• catalog description "Recursion: the Sierpinski curve -- Fast multiplication: divide and conquer -- Nondetermination: automata that guess correctly -- Neural nets: attempt at a brain -- Encoders and multiplexers: manipulating memory -- Cat scanning: cross-sectional X-rays -- The partition problem: a pseudofast algorithm -- Turing machines: the simplest computers -- The fast fourier transform: redistributing images -- Analog computation: spaghetti computers -- Satisfiability: a central problem -- Sequential sorting: a lower bound on speed -- Perceptrons: a lack of vision -- Public key cryptography: intractable secrets -- Sequential circuits: a computer memory -- Noncomputable functions: the busy beaver problem -- Heaps and merges: the fastest sorts of sorts -- NP-completeness: the wall of intractability -- Number systems for computing: Chinese arithmetic -- Storage by hashing: the key is the address".
• catalog extent "xiv, 415 p. :".
• catalog hasFormat "Turing omnibus.".
• catalog identifier "0716781549".
• catalog isFormatOf "Turing omnibus.".
• catalog issued "1989".
• catalog issued "c1989.".
• catalog language "eng".
• catalog publisher "Rockville, MD : Computer Science Press,".
• catalog relation "Turing omnibus.".
• catalog subject "004 19".
• catalog subject "Computers.".
• catalog subject "Electronic data processing.".
• catalog subject "QA76 .D45 1989".
• catalog tableOfContents "Algorithms: cooking up programs -- Finite automata: the black box -- Systems of logic: boolean bases -- Simulation: the Monte Carlo method -- Gödel's theorem: limits on logic -- Game trees: the minimax method -- The Chomsky hierarchy: four computers -- Random numbers: the Chaitin-Kolmogoroff theory -- Program correctness: ultimate debugging -- Search trees: traversal and maintenance -- Error-correcting codes: pictures from space -- Boolean logic: expressions and circuits -- Regular languages: pumping words -- Time and space complexity: the big-O notation -- The random access machine: an abstract computer -- Spline curves: smooth interpolation -- Computer vision: polyhedral scenes -- Karnaugh maps: circuit minimization -- Minimum spanning trees: a fast algorithm -- Generative grammars: Lindenmeyer systems".
• catalog tableOfContents "Cellular automata: the game of life -- Cook's theorem: nuts and bolts -- Self-replicating computers: Codd's machine -- Storing images: a cat in a quad tree -- The scram: a simplified computer -- Shannon's theory: the elusive codes -- Detecting primes: an algorithm that almost always works -- Universal turing machines: computers as programs -- Text compression: Huffman coding -- NP-complete problems: the tree of intractability -- Iteration and recursion: the towers of Hanoi -- VSLI computers: circuits in silicon -- Linear programming: the simplex method -- Predicate calculus: the resolution method -- The halting problem: the uncomputable -- Searching strings: the Boyer-Moore algorithm -- Parallel computing: processors with connections -- The word problem: dictionaries as programs -- Logic programming: prologue to an expert system -- Church's thesis: all computers are created equal -- Relational data bases: do-it-yourself queries.".
• catalog tableOfContents "Recursion: the Sierpinski curve -- Fast multiplication: divide and conquer -- Nondetermination: automata that guess correctly -- Neural nets: attempt at a brain -- Encoders and multiplexers: manipulating memory -- Cat scanning: cross-sectional X-rays -- The partition problem: a pseudofast algorithm -- Turing machines: the simplest computers -- The fast fourier transform: redistributing images -- Analog computation: spaghetti computers -- Satisfiability: a central problem -- Sequential sorting: a lower bound on speed -- Perceptrons: a lack of vision -- Public key cryptography: intractable secrets -- Sequential circuits: a computer memory -- Noncomputable functions: the busy beaver problem -- Heaps and merges: the fastest sorts of sorts -- NP-completeness: the wall of intractability -- Number systems for computing: Chinese arithmetic -- Storage by hashing: the key is the address".
• catalog title "The Turing omnibus : 61 excursions in computer science / A.K. Dewdney.".
• catalog type "Aufgabensammlung. swd".
• catalog type "text".