News for hackers. Stuff that matters.

A comment on How can we compare expressive power between two Turing-complete languages?. Parent comment

Re:How can we compare expressive power between two Turing-co... by renewiltord on Thursday July 06, 2023 @03:50AM (#36612633)
That's true. After all, in my E-lang I can solve every Project Euler program in under 6 bytes.
[ Parent | on HN ]
Re:How can we compare expressive power between two Turing-co... by charlieyu1 on Thursday July 06, 2023 @06:18AM (#36613752)
Even monopoly odds?
[ Parent | on HN ]