Talk:Circute

I love this stuff. That's why I boosted it. --Thematrixeatsyou 04:28, 13 Jul 2006 (UTC)

Year looks like 2005. --Graue 20:19, 18 Jul 2006 (UTC)

Flip-Flop

(moved here from User talk:Chris Pressey) Circute has *GOT* to have a flipflop... I have here an RS-latch, a length limiter, and a relay:

 =##########-
 =
 =N##
  # ###
  #N# #
   = =N#
   === #
     ==N=

=###############-
=
=======N#
=      #
=N######
 #
 #N#
  =
  ================

#    ========
=    =
=   #N#
=   #
= ==N===
= =    =
===  #N===########################-
  =   #
  ==N##
    #
    #N#
     =
     ========

Note that these diagrams could be wrong, as I whipped up the ALPACA source from memory :\ --Ben Russell 04:24, 13 December 2007 (UTC)

Memory cell

I have made a memory cell:

     =
  ##N=
  # #N##
  #    #
*=N#  #N=*

OFF    ON 

• The top cell will become a sparc if a pulse is sent down the right wire. ("ON")
• The top cell will be reset to a wire if a pulse is sent down the left wire. ("OFF")
• It needs a pulse of length 2 (two sparks and one tail, ##-) or longer to be correctly activated.

Add it to the article if you want.

--Anka 11:22, 5 January 2009 (UTC)

Computational class

It seems pretty obvious that any programs in this would be finite state machines, as there is no way to extend the memory. Signals can cross using only NAND gates, as four of them can be used to form XOR gates, three of which can then be used to form a crossing, so NAND gates being universal would seem to imply that this language can simulate any finite state machine.

*       *
====N====
=   =   =
===N=N===
=  = =  =
=  =N=  =
=   =   =
==N===N==
= = = = =
=N=N=N=N=
 = = = =
 =N= =N=
  =   =
  =   =

4D enthusiast (talk) 15:20, 6 May 2013 (BST)

Seems like my reply is 10 years late ;) While it's correct that memory in Circute cannot grow, I believe it still qualifies as Turing-complete since it (probably) would be Turing-complete if someone created an infinitely large program. "Languages" like Wireworld and Minecraft Redstone are usually regarded as Turing-complete despite requiring the programmer to manually create an infinite "playfield". Peter (talk) 13:28, 22 May 2023 (UTC)