Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
sean_pedersen
on May 5, 2021
|
parent
|
context
|
favorite
| on:
Kolmogorov Complexity: Extensions and Applications
I think you are right, since it entails the Halting problem it is not computable and thus not even in NP.
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
