Computability von weihrauch (23 Ergebnisse)

Hardcover. Zustand: Very Good. No Jacket. First Edition. A very good copy of the presumed first hard cover edition (no explicit edition or printing statement), lacking a dust-jacket. Previous owner's modest ex-libris stamp to front endsheet, else the text is wholly unmarked, pristine, and the binding and jacket are bright and fresh in appearance. A sharp copy.…

Hardcover. Zustand: Very Good. Bottom of spine has some light glue residue where more than likely a label of some sort was affixed. otherwise book is quite sharp and clean all around, with a tight binding and clean pages. Photos on request.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Gr.-8°. X, 517 Pages. Original Hardcover-Volume. 1st Edition (1987). X, 517 Pages. Very Go0od Condition. No Markings in the Text! No Underlinings! No Owner's Note! (EATCS - Monographs on Theoretical Computer Science).

Zustand: Good. Volume 9. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1050grams, ISBN:0387137211.

Zustand: New.

Zustand: New. In.

PF. Zustand: New.

Zustand: Used. pp. 517 2nd Edition.

Zustand: Used. pp. 517.

Zustand: New. pp. 532.

Zustand: Used. pp. 517.

Cloth. Zustand: Very Good. Zustand des Schutzumschlags: No d/j as Published. Type: Book Small plain label inside cover.

Paperback. Zustand: Brand New. reprint edition. 527 pages. 9.60x6.80x1.30 inches. In Stock.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Intends to lay a common basis for the different branches ofrecursion theory. Leads from the very basic theory to modernconcepts of computability. Consists of three consecutiveparts: 1. Basic Concepts of Computability. 2. TraditionalRecursion Theory. 3. Unified Type 2 theory of constructivityand computability on Baire's space including a general the-ory of representations. …

Hardcover. Zustand: Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.

Zustand: Good. Buchschnitt leicht verschmutzt. Ehemaliges Bibliotheksexemplar. Mit Bibliotheksstempel und Aufkleber am Buchrücken. Als übereignet gekennzeichnet.

Zustand: new. Questo è un articolo print on demand.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Intends to lay a common basis for the different branches ofrecursion theory. Leads from the very basic theory to modernconcepts of computability. Consists of three consecutiveparts: 1. Basic Concepts of Computability. 2. TraditionalRecursion Theory. 3. Unified Type 2 theory of constructivityand computability on Baire's space including a general the-ory of representations. 532 pp. Englisch.…

Zustand: New. Print on Demand pp. 532 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam.

Zustand: New. PRINT ON DEMAND pp. 532.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Prerequisites and Notation.- 1: Basic Concepts of Computability.- 1.1 Flowcharts and Machines.- 1.2 Register Machines and Register Computability.- 1.3 Primitive Recursive and ?-Recursive Functions.- 1.4 WHILE-Programs and WHILE-Computability.- 1.5 Tape Mach.…

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Prerequisites and Notation.- 1: Basic Concepts of Computability.- 1.1 Flowcharts and Machines.- 1.2 Register Machines and Register Computability.- 1.3 Primitive Recursive and -Recursive Functions.- 1.4 WHILE-Programs and WHILE-Computability.- 1.5 Tape Machines.- 1.6 Stack Machines.- 1.7 Comparison of Number and Word Functions, Church's Thesis.- 1.8 Recursive and Recursively Enumerable Sets.- 1.9 The Standard Numbering of P(1).- 1.10 Some Unsolvable Problems.- 2: Type 1 Recursion Theory.- 2.1 The Basic Concepts of Computability Theory.- 2.2 Numberings.- 2.3 Recursive and Recursively Enumerable Sets (Continued).- 2.4 Many-one and One-one Reducibility.- 2.5 The Recursion Theorem.- 2.6 Creative, Productive, Complete Sets.- 2.7 Effective Numberings.- 2.8 Ordinal Trees and Computable Ordinals.- 2.9 Some Applications to Logic.- 2.10 Oracle Machines and Relativized Recursion Theory.- 2.11 Turing Reducibility and the Kleene Hierarchy.- 2.12 Computational Complexity.- 3: Type 2 Theory of Constructivity and Computability.- 3.1 Type 2 Computability Models.- 3.2 Recursion Theory on Baire's Space.- 3.3 Representations.- 3.4 Effective Representations.- 3.5 Complete Partial Orders.- 3.6 Type 1 Computability and Type 2 Computability.- 3.7 Solving Domain Equations.- 3.8 Applications to Analysis.- Index of Notations.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 532 pp. Englisch.…