# Talk:INTERCAL

## Contents

## 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

## INTERCAL is Turing-complete

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

## Re: INTERCAL is Turing-complete

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

## INTERCAL is not Compiler Language With No Pronouncable Acronym

INTERCAL can be said in-ter-cal (the 'A' is 'A' an in cat ) --(this comment by 72.25.192.4 at 23:10, 13 September 2009 UTC; please sign your comments with ~~~~)

__ ___ _ ___ ___ ____ _ _ __/\_\ \ / / | | |/ _ \ / _ \/ ___|| | | |_/\__ \ /\ \ /\ / /| |_| | | | | | | \___ \| |_| \ / /_ _\ \ V V / | _ | |_| | |_| |___) | _ /_ _\ \/ \_/\_/ |_| |_|\___/ \___/|____/|_| |_| \/

--Ørjan 01:19, 14 September 2009 (UTC)

## Binary operators

I would find the INTERCAL binary select operator, as well as its (almost) inverse (filling unused positions with zero), to be very useful to have in other programming languages too; not only INTERCAL. --Zzo38 (talk) 20:38, 11 March 2013 (UTC)

- Apparently Intel agrees with you. These instructions have been implemented as machine code instructions on modern x86_64 processors (although with different names). --ais523 22:50, 9 April 2020 (UTC)

## Hardware INTERCAL

Is there INTERCAL into Verilog, VHDL, and discrete logic? --Zzo38 (talk) 20:38, 11 March 2013 (UTC)