NOTE: SMARTECH CONTENT FREEZE DEC 10 - 17. The Library will be unable to add or edit repository content during this scheduled maintenance. Please contact email@example.com for assistance.
Now showing items 1-1 of 1
Turing machine algorithms and studies in quasi-randomness
(Georgia Institute of Technology, 2011-11-09)
Randomness is an invaluable resource in theoretical computer science. However, pure random bits are hard to obtain. Quasi-randomness is a tool that has been widely used in eliminating/reducing the randomness from randomized ...