, ,

Computability, Enumerability, Unsolvability

Directions in Recursion Theory

Paperback Engels 1996 9780521557368
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

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.

Specificaties

ISBN13:9780521557368
Taal:Engels
Bindwijze:Paperback
Aantal pagina's:356

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Managementboek Top 100

Rubrieken

    Personen

      Trefwoorden

        Computability, Enumerability, Unsolvability