I guess thats the curse of programming. We all have a very clear understanding of how very very simple logic gates give rise to systems of infinite complexity.
It's a recurring pattern. SAT, the NP-complete problem, is at first glance a ridiculously simple task, yet solving it means being able to solve all other problems. When designing a language or a machine, it is very very simple to accidentally make it Turing compatible, the barrier is just so low, despite the reward being.. everything.
It's a recurring pattern. SAT, the NP-complete problem, is at first glance a ridiculously simple task, yet solving it means being able to solve all other problems. When designing a language or a machine, it is very very simple to accidentally make it Turing compatible, the barrier is just so low, despite the reward being.. everything.