Cargando…

Computability theory: an introduction

Computability Theory: An Introduction provides information pertinent to the major concepts, constructions, and theorems of the elementary theory of computability of recursive functions. This book provides mathematical evidence for the validity of the Church-Turing thesis.Organized into six chapters,...

Descripción completa

Detalles Bibliográficos
Autores principales: Jones, Neil D, Ashenhurst, Robert L
Lenguaje:eng
Publicado: Academic Press 1973
Materias:
Acceso en línea:http://cds.cern.ch/record/111957
Descripción
Sumario:Computability Theory: An Introduction provides information pertinent to the major concepts, constructions, and theorems of the elementary theory of computability of recursive functions. This book provides mathematical evidence for the validity of the Church-Turing thesis.Organized into six chapters, this book begins with an overview of the concept of effective process so that a clear understanding of the effective computability of partial and total functions is obtained. This text then introduces a formal development of the equivalence of Turing machine computability, enumerability, and decida