Get the latest tech news
A proof that Meson is Turing-Complete
A proof that Meson is actually Turing-Complete. Contribute to xorvoid/meson-brainfuck development by creating an account on GitHub.
After reading the docs, watching a few talks from Jussi Pakkanen, and experimenting on a few existing projects, I found myself pleasently suprised by Meson. Further, user-defined functions were rejected in the past because apparently they'd suddenly make Meson turing-complete. Mathematically speaking, no modern lanaguage is turning-complete because memory size on any machine has a fixed upper-bound.
Or read this on Hacker News
