ISBN: 9780387941745

ISBN-13: 9780387941745, 978-0387941745. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included. A Mathematical… More...

ISBN-13: 9780387941745, 978-0387941745. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included. A Mathematical Sketchbook. Computability Please note: this item is printed on demand and will take extra time before it can be dispatched to you (up to 20 working days).A Mathematical SketchbookAuthor(s): Douglas S. BridgesFormat: HardbackPublisher: Springer-Verlag New York Inc., United StatesImprint: Springer-Verlag New York Inc.ISBN-13: 9780387941745, 978-0387941745SynopsisAimed 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., Neu, Festpreisangebot, [LT: FixedPrice], Book Title: Computability, EAN: 9780387941745, Publication Year: 1994, Type: Textbook, Format: Hardcover, Language: English, Publication Name: Computability: a Mathematical Sketchbook, Item Height: 235mm, Item Width: 155mm, Subject: Mathematics, Item Weight: 1000g, Number of Pages: 180 Pages, Springer-Verlag NY Inc.<

2014, ISBN: 9780387941745

[ED: Buch], [PU: Springer New York], Neuware - Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchboo… More...

[ED: Buch], [PU: Springer New York], Neuware - 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.- Besorgungstitel - vorauss. Lieferzeit 3-5 Tage., DE, [SC: 2.70], Neuware, gewerbliches Angebot, 241x160x15 mm, 196, [GW: 465g], Banküberweisung, Offene Rechnung, Kreditkarte, PayPal, Offene Rechnung (Vorkasse vorbehalten), Internationaler Versand<

1994, ISBN: 9780387941745

Springer, Gebundene Ausgabe, Auflage: 1994, 191 Seiten, Publiziert: 1994-01-14T00:00:01Z, Produktgruppe: Buch, 2.2 kg, Computer & Internet, Kategorien, Bücher, Mathematik, Naturwissenscha… More...

Springer, Gebundene Ausgabe, Auflage: 1994, 191 Seiten, Publiziert: 1994-01-14T00:00:01Z, Produktgruppe: Buch, 2.2 kg, Computer & Internet, Kategorien, Bücher, Mathematik, Naturwissenschaften & Technik, Textbooks, Fremdsprachige Bücher, Englische Bücher, Format: Illustriert, Springer, 1994<

1994, ISBN: 0387941746

1994 Gebundene Ausgabe Mathematik, complexity; Function; recursion; theorem, mit Schutzumschlag 11, [PU:Springer New York; Springer US]