Computability enumerability unsolvability

Rubriek: Textual/Printed/Reference Materials - Boek

Prijs: € 59.99

Rating: 0/5

☆

☆

☆

☆

☆

Verzending:
Uiterlijk 31 januari in huis

The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. This volume provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory.



The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource.

• 1 Bekijk alle specificaties

Taal: en

Bindwijze: Paperback

Oorspronkelijke releasedatum: 11 januari 1996

Aantal pagina's: 347

Illustraties: Nee

Hoofdauteur: S.B. Cooper

Hoofdredacteur: S. B. Cooper

Tweede Redacteur: t. A. Slaman

Co Redacteur: Stanley S. Wainer

Hoofduitgeverij: Cambridge University Press

Extra groot lettertype: Nee

Product breedte: 159 mm

Product hoogte: 19 mm

Product lengte: 229 mm

Verpakking breedte: 159 mm

Verpakking hoogte: 19 mm

Verpakking lengte: 229 mm

Verpakkingsgewicht: 499 g

EAN: 9780521557368

---