Complexity theory provides new viewpoints on various phenomena that were considered by past thinkers.
Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory-in the discrete setting of bits and Turing machines. Over real numbers, on the other hand, the BSS-machine (aka real-RAM) ...
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in
Copyright © 2012 ACM
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Association for Computing Machinery
New York, NY, United States
Request permissions about this article.
Request Permissions
View or Download as a PDF file.
PDFView online with eReader.
eReaderView this article in HTML Format .
View HTML Format
Oded Goldreich
Comments