Quantcast

Alan's problem

classic Classic list List threaded Threaded
4 messages Options
Reply | Threaded
Open this post in threaded view
|  
Report Content as Inappropriate

Alan's problem

Mark Wieder via use-livecode
Is LiveCode Turing complete?

Richmond.
_______________________________________________
use-livecode mailing list
[hidden email]
Please visit this url to subscribe, unsubscribe and manage your subscription preferences:
http://lists.runrev.com/mailman/listinfo/use-livecode
Reply | Threaded
Open this post in threaded view
|  
Report Content as Inappropriate

Re: Alan's problem

Mark Wieder via use-livecode
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?
>
> Richmond.
> _______________________________________________
> use-livecode mailing list
> [hidden email]
> Please visit this url to subscribe, unsubscribe and manage your
> subscription preferences:
> http://lists.runrev.com/mailman/listinfo/use-livecode

_______________________________________________
use-livecode mailing list
[hidden email]
Please visit this url to subscribe, unsubscribe and manage your subscription preferences:
http://lists.runrev.com/mailman/listinfo/use-livecode
Reply | Threaded
Open this post in threaded view
|  
Report Content as Inappropriate

Re: Alan's problem

Mark Wieder via use-livecode
In reply to this post by Mark Wieder via use-livecode
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 <
[hidden email]> wrote:

> Is LiveCode Turing complete?
>
> Richmond.
> _______________________________________________
> use-livecode mailing list
> [hidden email]
> Please visit this url to subscribe, unsubscribe and manage your
> subscription preferences:
> http://lists.runrev.com/mailman/listinfo/use-livecode
>
_______________________________________________
use-livecode mailing list
[hidden email]
Please visit this url to subscribe, unsubscribe and manage your subscription preferences:
http://lists.runrev.com/mailman/listinfo/use-livecode
Reply | Threaded
Open this post in threaded view
|  
Report Content as Inappropriate

Re: Alan's problem

Mark Wieder via use-livecode
" 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 <
> [hidden email]> wrote:
>
>> Is LiveCode Turing complete?
>>
>> Richmond.
>> _______________________________________________
>> use-livecode mailing list
>> [hidden email]
>> Please visit this url to subscribe, unsubscribe and manage your
>> subscription preferences:
>> http://lists.runrev.com/mailman/listinfo/use-livecode
>>
> _______________________________________________
> use-livecode mailing list
> [hidden email]
> Please visit this url to subscribe, unsubscribe and manage your subscription preferences:
> http://lists.runrev.com/mailman/listinfo/use-livecode

_______________________________________________
use-livecode mailing list
[hidden email]
Please visit this url to subscribe, unsubscribe and manage your subscription preferences:
http://lists.runrev.com/mailman/listinfo/use-livecode
Loading...