Sophistication as Randomness Deficiency (chapter)
Name
Aaronson_Sophistication as.pdf
Size
374.84 KB
Format
Adobe PDF
Checksum (MD5)
4ce9dfc4d7cae56241f970ad726bd6b1
Author(s) • • •
Mota, Francisco
Aaronson, Scott
Antunes, Luís
Souto, André
Date Issued
2013
Journal
Descriptional Complexity of Formal Systems
Publisher
Springer-Verlag Berlin Heidelberg
Citation
Mota, Francisco, Scott Aaronson, Luís Antunes, and André Souto. “Sophistication as Randomness Deficiency.” in Descriptional Complexity of Formal Systems: 15th International Workshop, DCFS 2013, London, ON, Canada, July 22-25, 2013. Proceedings (Lecture Notes in Computer Science; ser. vol. 8031) (2013): 172–181.
Version
Author's final manuscript
Abstract
The sophistication of a string measures how much structural information it contains. We introduce naive sophistication, a variant of sophistication based on randomness deficiency. Naive sophistication measures the minimum number of bits needed to specify a set in which the string is a typical element. Thanks to Vereshchagin and Vitányi, we know that sophistication and naive sophistication are equivalent up to low order terms. We use this to relate sophistication to lossy compression, and to derive an alternative formulation for busy beaver computational depth.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-39310-5_17