Patterns hidden from simple algorithms
Author(s)
Sudan, Madhu
Downloadcacm-tp.pdf (73.39Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
Is the number 9021960864034418159813 random? Educated opinions might
vary from “No! No single string can be random,” to the more contemptuous
”Come on! Those are just the 714th to 733rd digits of π.” Yet, to my limited
mind, the string did appear random. Is there a way to use some formal
mathematics to justify my naïveté? The modern theory of pseudorandomness indeed manages to explain such phenomena, where strings appear random to simple minds. The key, this theory argues, is that randomness is really in the “eyes of the beholder,” or rather in the computing power of the tester of randomness. More things appear random to simpler, or resource limited, algorithms than to complex, powerful, algorithms.
Date issued
2011-04Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Communications of the ACM
Publisher
Association for Computing Machinery
Citation
Sudan, Madhu. Patterns Hidden from Simple Algorithms. Communications of the ACM 54, no. 4 (April 1, 2011): 107.
Version: Author's final manuscript
ISSN
00010782