New Turing Omnibus 66 Excursions in Computer Science

ISBN-10: 0805071660

ISBN-13: 9780805071665

Edition: 2000

Authors: A. K. Dewdney
List price: $34.99 Buy it from $26.41
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description: No other volume provides as broad, as thorough, or as accessible an introduction to the realm of computers as A. K. Dewdney's The Turing Omnibus. Updated and expanded, The Turing Omnibus offers 66 concise, brilliantly written articles on the major points of interest in computer science theory, technology, and applications. New for this tour: updated information on algorithms, detecting primes, noncomputable functions, and self-replicating computers--plus completely new sections on the Mandelbrot set, genetic algorithms, the Newton-Raphson Method, neural networks that learn, DOS systems for personal computers, and computer viruses.

New Starting from $26.74
what's this?
Rush Rewards U
Members Receive:
You have reached 400 XP and carrot coins. That is the daily max!

Customers also bought


Book details

List price: $34.99
Copyright year: 2000
Publisher: Henry Holt & Company
Publication date: 7/15/1993
Binding: Paperback
Pages: 480
Size: 6.30" wide x 9.10" long x 1.10" tall
Weight: 1.254
Language: English

Recreations, his column which appeared in Scientific American for more than eight years. He has been an Associate Professor of Computer Science at the University of Western Ontario in Canada since 1968, and is president of Turing Omnibus, Inc. Among his many books on computer science, science and mathematics are Two Hundred Percent of Nothing (1993), an effort to expose abuses of math and statistics in everyday life and its companion work, Yes, We Have No Neutrons (1997). Dewdney is also interested in growing and distributing rare native trees, as manifested in his book, Hungry Hollow: The Story of a Natural Place (1998). Hungry Hollow examines the elements of a natural habitat in both time and space.

Preface Icons
Cooking Up Programs
Finite Automata
The Black Box
Systems of Logic
Boolean Bases
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 Treesa Fast Algorithm
Generative Grammars
Lindenmayer Systems
The Sierpinski Curve
Fast Multiplication
Divide and Conquer
Automata That Guess Correctly
Perceptionsa Lack Of Vision
Encoders and Multiplexers
Manipulating Memory
Cat Scanning
Cross-Sectional X-Rays
Tie Partition Problema
Pseudo-fast Algorithm
Turing Machines
The Simplest Computers
The Fast Fourier Transform
Redistributing Images
Analog Computation
Spaghetti Computers
Central Problem
Sequential Sortinga
Lower Bound on Speed
Neural Networks That Learn
Converting Coordinates
Public Key Cryptography
Intractable Secrets
Sequential Circuitsa
Computer Memory
Noncomputable Functions
The Busy Beaver Problem
Heaps And Merges
The Fastest Sorts of Sorts
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 Imagesa
Cat in a Quad Tree
The Scrama
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 Virusesa
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
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.