- Acknowledgments.
- 1 Models of Computations; Polynomial Time & Church's Thesis.
- 2 Universal Algorithm; Diagonal Results.
- 3 Games; Alternation; Exhaustive Search; Time v. Space.
- 4 Nondeterminism; Inverting Functions; Reductions.
- 5 Randomness in Computing.
- References
- About this document ...

Wed Aug 21 20:35:42 EDT 1996