3 ms·
Here's an interesting puzzle: is SSL Turing-complete? This is a non-trivial question. On the one hand, it is known that single-stack machines are not Turing-c
by lisper 6y ago
Here's an interesting puzzle: is SSL Turing-complete? This is a non-trivial question. On the one hand, it is known that single-stack machines are not Turing-complete. On the other hand, perhaps one of the SSL primitives is enough to make it Turing-complete? If so, which one?