Talk:INTERCAL

From Esolang

[edit] Cellular automata

The ?,&,V operators are equivalent to cellular automata:

? = rule 102
& = rule 136
V = rule 238

Try doing just 1 operator, like this:

#102*.1 == .?1
#136*:2 == :&2

This also makes it easy to make a cellular automata program in INTERCAL, do rule 102 like:

DO COME FROM (105)
PLEASE DO .112 <- .?112
(105) DO (256) NEXT

[edit] INTERCAL is Turing-complete

Moved to its own page: INTERCAL Turing-completeness proof. Alksentrs 23:36, 21 January 2008 (UTC)

[edit] Re: INTERCAL is Turing-complete

Moved to Talk:INTERCAL Turing-completeness proof. Alksentrs 23:45, 21 January 2008 (UTC)