1 citations · 1 across the 5 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.IT2010
On Universal Complexity Measures
John Scoville
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal co…
cs.IT2010★ 1 cited
On Macroscopic Complexity and Perceptual Coding
John Scoville
The theoretical limits of 'lossy' data compression algorithms are considered. The complexity of an object as seen by a macroscopic observer is the size of the perceptual code which…