Re:SSL: Stupid Stack Language
by lisper on Saturday March 13, 2021 @10:24AM
(#26447158)
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?
[ Parent
| on HN ]
Is that a puzzle you're posing that I shouldn't spoil, or are you genuinely curious and interested in an answer here?