• Turing machine algorithms and studies in quasi-randomness 

      Kalyanasundaram, Subrahmanyam (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 ...