Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Preliminaries.- 1 What Is a Turing Machine?.- 2 Computable Partial Functions.- 3 Effective Enumerations.- 4 Computable Numbers and Functions.- 5 Rice’s Theorem and the Recursion Theorem.- 6 Abstract Complexity Theory.- Solutions to Exercises.- Solutions for Chapter 1.- Solutions for Chapter 2.- Solutions for Chapter 3.- Solutions for Chapter 4.- Solutions for Chapter 5.- Solutions for Chapter 6.- References.
Book by Bridges Douglas S
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Books From California, Simi Valley, CA, U.S.A.
Hardcover. Condizione: Very Good. Codice articolo mon0003837295
Quantità: 2 disponibili
Da: Books From California, Simi Valley, CA, U.S.A.
Hardcover. Condizione: Good. Book is bent. Codice articolo mon0003837237
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers. Codice articolo 671437-5
Quantità: 5 disponibili
Da: Textbooks_Source, Columbia, MO, U.S.A.
hardcover. Condizione: Good. 1994th Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). Codice articolo 000278514U
Quantità: 6 disponibili
Da: Looking for Books?, CORPUS CHRISTI, TX, U.S.A.
Hardcover. Condizione: Very Good+. Condizione sovraccoperta: No Dust Jacket. First Printing. Book is clean and tight. Looks almost new, husband says he read it and it is great. Turing machines.; Graduate Texts In Mathematics, 146; 6.29 X 0.71 X 9.57 inches; 178 pages. Codice articolo 10507
Quantità: 1 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers. Codice articolo 671437-5
Quantità: 5 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In English. Codice articolo ria9780387941745_new
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 671437-n
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 671437-n
Quantità: Più di 20 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Hardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Codice articolo C9780387941745
Quantità: Più di 20 disponibili