BN.com Gift Guide

The New Turing Omnibus: Sixty Six Excursions in Computer Science

Overview

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 ...

See more details below
Other sellers (Paperback)
  • All (13) from $17.35   
  • New (9) from $18.60   
  • Used (4) from $17.35   
Sending request ...

Overview

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.

Read More Show Less

Editorial Reviews

From the Publisher
"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

Read More Show Less

Product Details

  • ISBN-13: 9780805071665
  • Publisher: Holt, Henry & Company, Inc.
  • Publication date: 7/28/1993
  • Edition description: Enlarged & Updated
  • Pages: 480
  • Sales rank: 1,320,387
  • Product dimensions: 6.48 (w) x 9.19 (h) x 1.03 (d)

Meet the Author

A. K. Dewdney teaches computer science at the University of Western Ontario.

Read More Show Less

Table of Contents

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

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)