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.
Reihe
Sprache
Verlagsort
Verlagsgruppe
Cambridge University Press
Zielgruppe
Für höhere Schule und Studium
Illustrationen
Worked examples or Exercises
Dateigröße
ISBN-13
978-0-511-89313-1 (9780511893131)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
