Y
Hacker News
new
|
ask
|
show
|
jobs
by
lapinot
1619 days ago
Kolmogorov complexity kinda does account for "prior knowledge" (that's why it's not computable). A shakespearian sonnet will have low kolmogorov complexity (there's redundancy).