2 ms·
Non-Turing complete doesn't mean that you can't create too high complexity algorithms out of O(1) primitives.
by leni536 6y ago
Non-Turing complete doesn't mean that you can't create too high complexity algorithms out of O(1) primitives.
- curryhoward 6y agoDid you mean to reply to a different comment? You seem to be restating the correct part of orthoxerox's comment. I was merely refuting the incorrect part.