" As the name suggests, brainfuck programs tend to be difficult to
comprehend."
No, Really?
Richmond.
On 4/30/17 6:04 pm, Lagi Pittas via use-livecode wrote:
Since you can write a Turing machine and a Universal Turing Machine
emulator in Livecode - it definitely is.
What made you think it wasn't? - SQL is not Turing complete the Regex
built into LC is not Turing Complete btw.
Oh and BrainF*k is ;-)
https://en.wikipedia.org/wiki/Brainfuck
Regards lagi
On 30 April 2017 at 11:27, Richmond Mathewson via use-livecode <
use-livecode@lists.runrev.com> wrote:
Is LiveCode Turing complete?
Richmond.
_______________________________________________
use-livecode mailing list
use-livecode@lists.runrev.com
Please visit this url to subscribe, unsubscribe and manage your
subscription preferences:
http://lists.runrev.com/mailman/listinfo/use-livecode
_______________________________________________
use-livecode mailing list
use-livecode@lists.runrev.com
Please visit this url to subscribe, unsubscribe and manage your subscription
preferences:
http://lists.runrev.com/mailman/listinfo/use-livecode
_______________________________________________
use-livecode mailing list
use-livecode@lists.runrev.com
Please visit this url to subscribe, unsubscribe and manage your subscription
preferences:
http://lists.runrev.com/mailman/listinfo/use-livecode
