Computability
Book information
Description
Intends to lay a common basis for the different branches of recursion theory. Leads from the very basic theory to modern concepts of computability. Consists of three consecutive parts: 1. Basic Concepts of Computability. 2. Traditional Recursion Theory. 3. Unified Type 2 theory of constructivity and computability on Baire's space including a general theory of representations.
Similar books
DNA Computing: 12th International Meeting on DNA Computing, DNA12, Seoul, Korea, June 5-9, 2006, Revised Selected Papers
2006 · PDF
Unconventional Computation: 8th International Conference, UC 2009, Ponta Delgada, Portugal, September 7-11, 2009. Proceedings
2009 · PDF
Implementation and Application of Automata: 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009. Proceedings
2009 · PDF
Language and Automata Theory and Applications: 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings
2010 · PDF
DNA Computing and Molecular Programming: 16th International Conference, DNA 16, Hong Kong, China, June 14-17, 2010, Revised Selected Papers
2011 · PDF
Unconventional Computation: 10th International Conference, UC 2011, Turku, Finland, June 6-10, 2011. Proceedings
2011 · PDF
Implementation and Application of Automata: 17th International Conference, CIAA 2012, Porto, Portugal, July 17-20, 2012. Proceedings
2012 · PDF
Implementation and Application of Automata: 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings
2013 · PDF