Compressed File Length Predicts Search Time and Errors on Visual Displays
Displays, 2005. [All Versions]. Compressed file size, an objective, easily obtained measure of display complexity, predicts both subjective complexity judgments and objective search performance. It is analogous to algorithmic complexity, a theoretical but impractical measure of…
- from
- AGI & CoCoSci
- added
- 2026-10-10
- likes
- 0
similar
-
PE Compression Test web.archive.org
List of packers tested on a few sample executables for comparing compressed sizes.
-
A complexity measure ieeexplore.ieee.org
-
Seeing and speaking: How verbal “description length” encodes visual complexity perception.jhu.edu
Journal of Experimental Psychology, 2022. [All Versions]. [APA]. Empirical evidencs showing the relation between visual complexity and description length.
-
The KoLMogorov Test: Compression by Code Generation openreview.net
ICLR'25, 2025. [All Versions]. Compression is at the heart of intelligence. A theoretically optimal way to compress any sequence of data is to find the shortest program that outputs that sequence and then halts. However, such Kolmogorov compression is uncomputable, and code…
-
CompSize github.com
Check btrfs compression ratios on Steam Deck.
-
Sitecore Computed Search github.com
An index search development accelerator that allows developers to declare computed search fields on an index that can capture and store targeted field values of items within a scope as well as the field values of items based on specific templates that are part of its…
AGI & CoCoSci › Papers > Complexity & Information Theory > Visual Complexity: “Displays, 2005. [All Versions]. Compressed file size, an objective, easily obtained measure of display complexity, predicts both subjective complexity judgments and objective search performance. It is analogous to algorithmic complexity, a theoretical but impractical measure of…”