3 ms·
Well if you wrote a program in any Turing complete programming language, you would be done; how "trivial" it is doesn't matter. :)
by dinkumthinkum 14y ago
Well if you wrote a program in any Turing complete programming language, you would be done; how "trivial" it is doesn't matter. :)
- greyfade 14y agoIndeed. By the Church-Turing Thesis, any program written for any Turing Machine (including any Turing-complete language) can be translated into the lambda calculus through a rote transformation.