三民網路書店 / 搜尋結果

Alan Turing was an inspirational figure who is now recognised as a genius of modern mathematics. In addition to leading the Allied forces' code-breaking effort at Bletchley Park in World War II, he proposed the theoretical foundations of modern computing and anticipated developments in areas from information theory to computer chess. His ideas have been extraordinarily influential in modern mathematics and this book traces such developments by bringing together essays by leading experts in logic, artificial intelligence, computability theory and related areas. Together, they give insight into this fascinating man, the development of modern logic, and the history of ideas. The articles within cover a diverse selection of topics, such as the development of formal proof, differing views on the Church–Turing thesis, the development of combinatorial group theory, and Turing's work on randomness which foresaw the ideas of algorithmic randomness that would emerge many years later.

This book is concerned with the theory of computability and complexity over the real numbers. This theory was initiated by Turing, Grzegorczyk, Lacombe, Banach and Mazur and has seen rapid growth in

An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices"

The Asian Logic Conference is one of the largest meetings, and this volume represents work presented at, and arising from the 12th meeting. It collects a number of interesting papers from experts in t

Parameterized complexity is currently a thriving field in complexity theory and algorithm design. A significant part of the success of the field can be attributed to Michael R. Fellows. This Festschri