My Links ATasteOfTWiki view a short introductory presentation on TWiki for beginners WelcomeGuest starting points on TWiki TWikiUsersGuide complete ...
Cantor's Legacy: Infinity and Diagonalization Georg Cantor (1845 1918) The Ideal Computer The ideal computer has infinite memory. There are two ways to look at this ...
Basic Information on Circuits You should already be familiar with logical functions like OR and AND. A gate is just a visual representation of these functions. For ...
Combinatorial Games Combinatorial games are two person games with perfect information and no chance moves, and with a win or lose outcome. Such a game is determined ...
Combinatorial Games Combinatorial games are two person games with perfect information and no chance moves, and with a win or lose outcome. Such a game is determined ...
Correspondences and Choice Trees Gamblers and other people playing card or dice games depend on more than luck to succeed. They need to know the odds #8212;how likely ...
Recurring Problems and Correspondences Counting problems are an important part of theoretical computer science. For many such problems, there is no specific theory ...
Course Syllabus (PDF version) Welcome to 15 251! This course will take a philosophical and historical perspective on the development of theoretical computer science ...