ParentFull threadleni536·Non-Turing complete doesn't mean that you can't create too high complexity algorithms out of O(1) primitives.View on HN