Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra. Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algorithmics (randomized alogrithms), parametric complexity, Kolmogorov complexity of finite strings, computational group theory, counting problems, and canonical models of ZFC providing a solution to continuum hypothesis. The text addresses students in computer science or mathematics, and professionals i

Computational complexity --- Machine theory

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Machine elements --- machines

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume gathers lectures by 8 distinguished pioneers of automata theory, including two Turing Award winners. In each contribution, the early developments of automata theory are reminisced about and future directions are suggested. Although some of the contributions go into rather intriguing technical details, most of the book is accessible to a wide audience interested in the progress of the age of computers. The book is a must for professionals in theoretical computer science and related areas of mathematics. For students in these areas it provides an exceptionally deep view at the begi

Machine theory --- Algebra

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Machine elements --- risico's --- machines

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Systèmes homme-machine --- Interaction homme-ordinateur