Computability, Enumerability, Unsolvability: Directions in Recursion Theory S B Cooper

ISBN: 9780511893131

Published: January 11th 1996

ebook

356 pages


Description

Computability, Enumerability, Unsolvability: Directions in Recursion Theory  by  S B Cooper

Computability, Enumerability, Unsolvability: Directions in Recursion Theory by S B Cooper
January 11th 1996 | ebook | PDF, EPUB, FB2, DjVu, talking book, mp3, ZIP | 356 pages | ISBN: 9780511893131 | 7.63 Mb

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 andMoreThe 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.



Enter the sum





Related Archive Books



Related Books


Comments

Comments for "Computability, Enumerability, Unsolvability: Directions in Recursion Theory":


renewalhealthclub.com

©2010-2015 | DMCA | Contact us