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,...
Autores principales: | , |
---|---|
Lenguaje: | eng |
Publicado: |
Academic Press
1973
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/111957 |
_version_ | 1780878436348198912 |
---|---|
author | Jones, Neil D Ashenhurst, Robert L |
author_facet | Jones, Neil D Ashenhurst, Robert L |
author_sort | Jones, Neil D |
collection | CERN |
description | 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 |
id | cern-111957 |
institution | Organización Europea para la Investigación Nuclear |
language | eng |
publishDate | 1973 |
publisher | Academic Press |
record_format | invenio |
spelling | cern-1119572021-04-22T04:58:41Zhttp://cds.cern.ch/record/111957engJones, Neil DAshenhurst, Robert LComputability theory: an introductionMathematical Physics and MathematicsComputability 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 decidaAcademic Pressoai:cds.cern.ch:1119571973 |
spellingShingle | Mathematical Physics and Mathematics Jones, Neil D Ashenhurst, Robert L Computability theory: an introduction |
title | Computability theory: an introduction |
title_full | Computability theory: an introduction |
title_fullStr | Computability theory: an introduction |
title_full_unstemmed | Computability theory: an introduction |
title_short | Computability theory: an introduction |
title_sort | computability theory: an introduction |
topic | Mathematical Physics and Mathematics |
url | http://cds.cern.ch/record/111957 |
work_keys_str_mv | AT jonesneild computabilitytheoryanintroduction AT ashenhurstrobertl computabilitytheoryanintroduction |