Прекрасный учебник по моделям вычислений
Mar. 27th, 2013 09:21 pmВсячески рекомендую всем замечательный учебник Maribel Fernandez под названием "Models of Computation: An Introduction to Computability Theory". С одной стороны, он написан сжато и по существу, но при этом простым языком, содержит упражнения и покрывает современный материал.
Учебник начинается с введения в классическую теории вычислимости: машины Тьюринга и лямбда-исчисление. Затем следует подробное описание систем взаимодействия, включая полезную нотацию Lafont. Наконец, дается обзор некоторых зарождающихся направлений.
A Concise Introduction to Computation Models and Computability Theory provides an introduction to the essential concepts in computability, using several models of computation, from the standard Turing Machines and Recursive Functions, to the modern computation models inspired by quantum physics. An in-depth analysis of the basic concepts underlying each model of computation is provided. Divided into two parts, the first highlights the traditional computation models used in the first studies on computability:
- Automata and Turing Machines;
- Recursive functions and the Lambda-Calculus;
- Logic-based computation models.
The second part covers object-oriented and interaction-based models. There is also a chapter on concurrency, and a final chapter on emergent computation models inspired by quantum mechanics. At the end of each chapter there is a discussion on the use of computation models in the design of programming languages.
http://www.amazon.co.uk/dp/1848824335
Учебник начинается с введения в классическую теории вычислимости: машины Тьюринга и лямбда-исчисление. Затем следует подробное описание систем взаимодействия, включая полезную нотацию Lafont. Наконец, дается обзор некоторых зарождающихся направлений.
A Concise Introduction to Computation Models and Computability Theory provides an introduction to the essential concepts in computability, using several models of computation, from the standard Turing Machines and Recursive Functions, to the modern computation models inspired by quantum physics. An in-depth analysis of the basic concepts underlying each model of computation is provided. Divided into two parts, the first highlights the traditional computation models used in the first studies on computability:
- Automata and Turing Machines;
- Recursive functions and the Lambda-Calculus;
- Logic-based computation models.
The second part covers object-oriented and interaction-based models. There is also a chapter on concurrency, and a final chapter on emergent computation models inspired by quantum mechanics. At the end of each chapter there is a discussion on the use of computation models in the design of programming languages.
http://www.amazon.co.uk/dp/1848824335
