Picture 1 of 2


Gallery
Picture 1 of 2


Have one to sell?
New Turing Omnibus by Dewdney, A. K. Paperback Book The Fast Free Shipping
FREE US DELIVERY | ISBN: 0805071660 | Quality Books
US $23.57
ApproximatelyRM 99.65
Condition:
Very Good
A book that has been read but is in excellent condition. No obvious damage to the cover, with the dust jacket included for hard covers. No missing or damaged pages, no creases or tears, and no underlining/highlighting of text or writing in the margins. May be very minimal identifying marks on the inside cover. Very minimal wear and tear.
5 available
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
Free USPS Ground Advantage®.
Located in: Florida, United States
Delivery:
Estimated between Mon, 4 Aug and Mon, 11 Aug to 91768
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:392295383184
Item specifics
- Condition
- ISBN
- 0805071660
- EAN
- 9780805071665
- Date of Publication
- 2003-08-01
- Release Title
- New Turing Omnibus
- Artist
- DEWDNEY, A. K.
- Brand
- N/A
- Colour
- N/A
- Book Title
- New Turing Omnibus
About this product
Product Identifiers
Publisher
Holt & Company, Henry
ISBN-10
0805071660
ISBN-13
9780805071665
eBay Product ID (ePID)
2299284
Product Key Features
Number of Pages
480 Pages
Language
English
Publication Name
New Turing Omnibus : Sixty-Six Excursions in Computer Science
Subject
Computer Science, Essays
Publication Year
1993
Type
Textbook
Subject Area
Mathematics, Computers
Format
Trade Paperback
Dimensions
Item Height
1 in
Item Weight
25.4 Oz
Item Length
9.3 in
Item Width
6.5 in
Additional Product Features
Intended Audience
Trade
TitleLeading
The
Reviews
"Wonderfully concise discussions . . . full of wit . . . It is nearly the perfect book for the noncomputer scientists who want to learn something about the field."- Nature "Recommended as a general topics source for anyone interested in computer science. Dewdney's use of unusual and practical examples and illustrations to explain the material makes his very readable prose even better."- Choice "A useful book of worthwhile diversions."- Computer Books Review, "Wonderfully concise discussions . . . full of wit . . . It is nearly the perfect book for the noncomputer scientists who want to learn something about the field."-Nature "Recommended as a general topics source for anyone interested in computer science. Dewdney's use of unusual and practical examples and illustrations to explain the material makes his very readable prose even better."-Choice "A useful book of worthwhile diversions."-Computer Books Review, Wonderfully concise discussions . . . full of wit . . . It is nearly the perfect book for the noncomputer scientists who want to learn something about the field., Recommended as a general topics source for anyone interested in computer science. Dewdney's use of unusual and practical examples and illustrations to explain the material makes his very readable prose even better., "Wonderfully concise discussions . . . full of wit . . . It is nearly the perfect book for the noncomputer scientists who want to learn something about the field." -- Nature "Recommended as a general topics source for anyone interested in computer science. Dewdney's use of unusual and practical examples and illustrations to explain the material makes his very readable prose even better." -- Choice "A useful book of worthwhile diversions." -- Computer Books Review
Illustrated
Yes
Table Of Content
Preface Icons 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 TRESS The Minimax Method THE COMSKY HIERARCHY Four Computers RANDOM NUMBERS The Chaitin-Kolmogoroff Theory MATHEMATICAL RESEARCH The Mandelbrot Set PROGRAM CORRECTNESS Ultimate Debugging SEARCH TRESS Traversal and Maintenance ERROR-CORRECTING CODE Pictures from Space BOOLEAN LOGIC Expressions and Circuits REGULAR LANGUAGE Pumping Words TIME AND SPACE COMPLEXITY The Big-0 Notation GENETIC ALGORITHMS Solutions That Evolve THE RANDOM ACCESS MACHINE An Abstract Computer SPINAL CURVES Smooth Interpolation COMPUTER VISION Polyhedral Scenes KARNAUGH MAPS Circuit Minimization THE NEWTON-RAPHSON METHOD Finding Roots MINIMUM SPANNING TREES A Fast Algorithm GENERATIVE GRAMMARS Lindenmayer Systems RECURSION The Sierpinski Curve FAST MULTIPLICATION Divide and Conquer NONDETERMINISM Automata That Guess Correctly PERCEPTIONS A Lack of Vision ENCODERS AND MULTIPLEXERS Manipulating Memory CAT SCANNING Cross-Sectional X-Rays TIE PARTITION PROBLEM A Pseudo-fast 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 NEURAL NETWORKS THAT LEARN Converting Coordinates 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 Wall of Intractability NUMBER SYSTEMS FOR COMPUTING Chinese Arithmetic STORAGE BY HASHING The Key Is the Address 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 DISK OPERATING SYSTEMS Bootstrapping the Computer NP-COMPLETE PROBLEMS The Tree of Intractability ITERATION AND RECURSION The Towers of Hanoi VLSI COMPUTERS Circuits in Silicon LINEAR PROGRAMMING The Simplex Method PREDICATE CALCULUS The Resolution Method THE HALTING PROBLEM The Uncomputable COMPUTER VIRUSES A Software Invasion SEARCHING STRINGS The Boyer-Moore Algorithm PARALLEL COMPUTING Processors with Connections THE WORD PROBLEM Dictionaries as Programs LOGIC PROGRAMMING Prologue to Expertise RELATIONAL DATABASES Do-It-Yourself Queries CHURCH'S THESIS All Computers Are Created Equal Index
Edition Description
Revised edition,Enlarged edition
Synopsis
No other volume provides as broad, as thorough, or as accessible an introduction to the realm of computer science as A. K. Dewdney's The Turing Omnibus. For everyone from the curious beginner to the working professional, The New Turing Omnibus offers 66 concise, brilliantly written mathematically oriented articles on the major points of interest in computer science theory, technology, and applications. Foundational for this tour: information on algorithms, detecting primes, noncomputable functions, and self-replicating computers--plus fundamental sections on the Mandelbrot set, genetic algorithms, the Newton-Raphson Method, neural networks that learn, DOS systems for personal computers, and computer viruses.
LC Classification Number
QA76.D448 2000
Item description from the seller
Seller business information
VAT number: GB 922696893
Seller feedback (1,557,428)
- h***f (732)- Feedback left by buyer.Past monthVerified purchasePerfect
- n***a (230)- Feedback left by buyer.Past monthVerified purchasePerfect.
- 4***o (285)- Feedback left by buyer.Past monthVerified purchaseGreat deal - Item arrived safely and in EX condition - Thank you!
More to explore :
- Nonfiction Ships Paperbacks Books,
- Philip K. Dick Paperbacks Books,
- Paperbacks Books,
- Fiction & Philip K. Dick Paperback Books,
- New Age Nonfiction Paperbacks Books,
- With Vintage Paperbacks Books,
- Paperbacks Books in English,
- Stephen King Paperbacks Books,
- Vintage Paperback Books for Children,
- Nonfiction Books Fiction & Ships