On Sat, Jan 12, 2013 at 2:08 PM, Alex Vondrak <ajvond...@gmail.com> wrote:
> > Imagine if it is possible to mimic every Algol construct in Factor with
> > objects, quotations, and fry specifiers.
>
> Strictly speaking, it already is possible...which isn't saying much:
> https://en.wikipedia.org/wiki/Turing_completeness
>
''Computability theory
<https://en.wikipedia.org/wiki/Computability_theory>includes the
closely related concept of Turing
equivalence <https://en.wikipedia.org/wiki/Turing_equivalence>. Two
computers P and Q are called Turing equivalent if P can simulate Q and Q
can simulate P.''
Assume P is the Factor listener.
Assume Q is the RetroForth REPL.
If equivalence between P and Q, could be doing some cool stuff on $5 Ngaro
chips.
------------------------------------------------------------------------------
Master Visual Studio, SharePoint, SQL, ASP.NET, C# 2012, HTML5, CSS,
MVC, Windows 8 Apps, JavaScript and much more. Keep your skills current
with LearnDevNow - 3,200 step-by-step video tutorials by Microsoft
MVPs and experts. SALE $99.99 this month only -- learn more at:
http://p.sf.net/sfu/learnmore_122912
_______________________________________________
Factor-talk mailing list
Factor-talk@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/factor-talk
