Complexity & Chaos 169 running any algorithm can solve, and then yy : there are the free will problems: how do YY ~ we pick a problem in the first place? How XK ~~ do inventors come up with problems no | % C4 one had ever thought to solve in the first i place, such as the invention of the Rubik’s \d Cube? S —— y Erné Rubik's Cube Problem Example Flat Print File (for Human) nlogn Searching a list Linear Finding the lowest number in a list Logarithmic Long Multiplication Exponential Long Division P Most Algorithms Near NP Factor Prime Number NP-non-complete Perfect Game of Chess NP-Complete, tractable Travelling Salesman, SAT Chaotic Weather NP-Complete, Quantum Modeling a Quantum Process NP-Complete, intractable Busy Beaver, Towers of Hanoi PSPACE Graph Problems, Places Game Creativity, Finding Fermat Theorem for a Non-computable Turing machine, Tiling the plane with Penrose Triangles Non-deterministic, Non-time divisible, Non- Free will computable Halting problem for a Turing Machine, some mathematical theorems such as the Continuum Impossible Hypothesis in ZF+AC (Hilberts Ist). Travelling faster than the speed of light. Understanding the American tax code. Known Unknowns I know that I don't know either way. Unknown Unkzowns he et heh a hat ution et HOUSE_OVERSIGHT_015859