





Computability Theory: An Introduction to Recursion Theory
The study of the class of computable partial functions (i.e., recursive partial functions)
stands at the intersection of three fields: mathematics, theoretical computer science,
and philosophy.
Mathematically, computability theory originates from the concept of an algorithm.
It leads to a classification of functions according...   An Introduction to Genetic Algorithms (Complex Adaptive Systems)
Science arises from the very human desire to understand and control the world. Over the course of history, we
humans have gradually built up a grand edifice of knowledge that enables us to predict, to varying extents, the
weather, the motions of the planets, solar and lunar eclipses, the courses of diseases, the rise and fall...   

A HalfCentury of Automata Theory: Celebration and InspirationSuggests Automata Theory may be poised for another period of significant advance, similar to that in the 1960s and 1970s.  Mathematical Reviews, 2002
This volume gathers lectures by 8 distinguished pioneers of automata theory, including two Turing Award winners. In each contribution, the early developments of...     


Result Page: 6 5 4 3 2 1 