" 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 was
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 lag
Definitely.
Kind regards,
Mark Schonewille
http://economy-x-talk.com
https://www.facebook.com/marksch
Buy the most extensive book on the
LiveCode language:
http://livecodebeginner.economy-x-talk.com
Op 30-Apr-17 om 12:27 schreef Richmond Mathewson via use-livecode:
Is LiveCode Turing complete
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
