Back to Discover
🔢

Kolmogorov complexity

math Maturity 11-13

Some things are easy to say. You can say "write ab sixteen times." This is a short way. Other things are hard to say. You must say every part. This takes a long time. Can you find a short way?

Mandelpart2 red.png
Mandelpart2 red.png

42 words
🖼️ Images & Media (2)
File:Mandelpart2 red.png
Mandelpart2 red.png
File:Kolmogorov complexity and computable lower bounds svg.svg
Kolmogorov complexity and computable...
Up Next
🔢
Blum axioms
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Blum axioms 0% Cantor's diagonal argument 0% Decision problem 0% NP-hardness 0% Computable set 0% NP (complexity) 0%

🔬 Go deeper

More advanced topics to explore

Theoretical computer science Decision problem NP-hardness NP (complexity)

🪜 Step back

Simpler topics to build understanding

Blum axioms Cantor's diagonal argument Computable set Turing degree
📚 Content adapted from Wikipedia | Readability: FK 12.0 | Vital Level 5