New Turing Omnibus (New Turning Omnibus : 66 Excursions In Computer Science)

New Turing Omnibus (New Turning Omnibus : 66 Excursions In Computer Science)

SKU: SONG0716782715 Out of Stock
Sale price$12.33 Regular price$13.57
Sold out Save $1.24
Quantity
Add to wishlist
Add to compare
Shipping & Tax will be calculated at Checkout.
Delivery time: 3-5 business days (USA)
Delivery time: 8-12 business days (International)
15 days return policy
Payment Options

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)

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 Selfreplicating Computersplus Completely New Sections On The Mandelbrot Set, Genetic Algorithms, The Newtonraphson Method, Neural Networks That Learn, Dos Systems For Personal Computers, And Computer Viruses.Contents:1 Algorithms 2 Finite Automata 3 Systems Of Logic 4 Simulation 5 Godel'S Theorem 6 Game Trees 7 The Chomsky Hierarchy 8 Random Numbers 9 Mathematical Research 10 Program Correctness 11 Search Trees 12 Errorcorecting Codes 13 Boolean Logic 14 Regular Languages 15 Time And Space Complexity 16 Genetic Algorithms 17 The Random Access Machine 18 Spline Curves 19 Computer Vision 20 Karnaugh Maps 21 The Newtonraphson Method 22 Minimum Spanning Trees 23 Generative Grammars 24 Recursion 25 Fast Multiplication 26 Nondeterminism 27 Perceptrons 28 Encoders And Multiplexers 29 Cat Scanning 30 The Partition Problem 31 Turing Machines 32 The Fast Fourier Transform 33 Analog Computing 34 Satisfiability 35 Sequential Sorting 36 Neural Networks That Learn 37 Public Key Cryptography 38 Sequential Cirucits 39 Noncomputerable Functions 40 Heaps And Merges 41 Npcompleteness 42 Number Systems For Computing 43 Storage By Hashing 44 Cellular Automata 45 Cook'S Theorem 46 Selfreplicating Computers 47 Storing Images 48 The Scram 49 Shannon'S Theory 50 Detecting Primes 51 Universal Turing Machines 52 Text Compression 53 Disk Operating Systems 54 Npcomplete Problems 55 Iteration And Recursion 56 Vlsi Computers 57 Linear Programming 58 Predicate Calculus 59 The Halting Problem 60 Computer Viruses 61 Searching Strings 62 Parallel Computing 63 The Word Problem 64 Logic Programming 65 Relational Data Bases 66 Church'S Thesis

Shipping & Returns

Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.

Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.

Shipping & Returns

Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.

Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.

Warranty

We provide a 2-year limited warranty, from the date of purchase for all our products.

If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.

This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).

Warranty

We provide a 2-year limited warranty, from the date of purchase for all our products.

If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.

This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).

Secure Payment

Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.

We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.

Secure Payment

Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.

We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.

Related Products

You may also like

Frequently Asked Questions

  • Q: What topics are covered in 'The New Turing Omnibus'? A: 'The New Turing Omnibus' covers a wide range of topics in computer science, including algorithms, detecting primes, noncomputable functions, self-replicating computers, the Mandelbrot set, genetic algorithms, the Newton-Raphson Method, and neural networks.
  • Q: Who is the author of 'The New Turing Omnibus'? A: The author of 'The New Turing Omnibus' is A.K. Dewdney, a noted computer scientist and educator.
  • Q: Is this book suitable for beginners in computer science? A: 'The New Turing Omnibus' is designed for a broad audience and is suitable for beginners as it provides concise articles that introduce major concepts in computer science.
  • Q: What is the binding type of this book? A: This edition of 'The New Turing Omnibus' is published in paperback binding.
  • Q: How many pages does 'The New Turing Omnibus' have? A: 'The New Turing Omnibus' contains a total of 480 pages.
  • Q: When was 'The New Turing Omnibus' first published? A: 'The New Turing Omnibus' was first published on January 1, 1993.
  • Q: Does this book include updated information from previous editions? A: Yes, 'The New Turing Omnibus' has been updated and expanded to include new information on various topics in computer science.
  • Q: What condition is the used book in? A: The used book is listed as being in good condition.
  • Q: Are there any new sections in the latest edition? A: Yes, the latest edition includes completely new sections on topics such as computer viruses and DOS systems for personal computers.
  • Q: What can I expect to learn from this book? A: Readers can expect to gain a broad understanding of key concepts in computer science, including both theoretical and practical applications.