
Computability, Enumerability, Unsolvability : Directions in Recursion Theory
London Mathematical Society Lecture Note Series
|
Heftet
Produseres på bestilling
Leveringstid: 2-4 uker
Handlinger
Beskrivelse
Omtale
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.
Detaljer
-
Utgivelsesdato:
11.01.1996
-
ISBN:
9780521557368
-
Språk:
, Engelsk
-
Forlag:
Cambridge University Press -
Fagtema:
-
Serie:
London Mathematical Society Lecture Note Series
-
Litteraturtype:
-
Sider:
356
-
Høyde:
22.8 cm
-
Bredde:
15.2 cm