University of Kentucky Profesor Emeritus F.D. Lewis's text is divided into five major chapters named Computability, Unsolvability, Complexity, Automata, and Languages. Each of these in turn consists of several smaller sections.
Dear visitor, you went to the site as unregistered user. We encourage you to register or enter the site under your name.