num_pages: 356
description: 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 provide a picture of current ideas and methods in the ongoing investigations into the structure of the computable and noncomputable universe. A number of the articles contain introductory and background material that will make the volume an invaluable resource for mathematicians and computer scientists.
language: English
title: Computability, Enumerability, Unsolvability: Directions in Recursion Theory
titlecomplete: Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series, Series Number 224)
ratings_count: 1
series: London Mathematical Society Lecture Note
publisher: Cambridge University Press