Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

Cellular Automaton, Part I

Name: Anonymous 2009-07-03 19:00

I have wrote a Wireworld CA program in Java and have realized how the OR-gate & XOR-gate works, but I'm still having problems with realizing the AND-gate. Anybody have some experience with this cellular automaton?


//The OR-gate:

0 0 0 0 0 0 0 0
0 3 3 3 0 0 0 0
0 0 0 0 3 0 0 0
0 0 0 3 3 3 3 0
0 0 0 0 3 0 0 0
0 2 1 3 0 0 0 0
0 0 0 0 0 0 0 0

//The XOR-gate:

0 0 0 0 0 0 0 0 0 0
0 2 1 3 0 0 0 0 0 0
0 0 0 0 3 0 0 0 0 0
0 0 0 3 3 3 3 0 0 0
0 0 0 3 0 0 3 3 3 0
0 0 0 3 3 3 3 0 0 0
0 0 0 0 3 0 0 0 0 0
0 2 1 3 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0

Name: Anonymous 2009-07-03 19:01

>>1
*written

Name: Anonymous 2009-07-03 19:23

>>1-2
5/10

Name: Anonymous 2009-07-03 19:57

>>3
½
Optimised that for you.

Name: Anonymous 2009-07-03 20:17

I just realized the pattern:


0 0 0 0 0 0 0 0 0 0 0 0 0
0 2 1 3 0 0 3 3 3 0 0 0 0
0 0 0 3 0 3 0 0 0 3 0 0 0
0 0 3 3 3 3 0 3 3 3 3 0 0
0 0 3 0 0 3 3 3 0 3 0 3 0
0 0 3 3 3 3 0 3 3 3 3 0 0
0 0 0 3 0 3 0 0 0 3 0 0 0
0 2 1 3 0 0 3 3 3 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0

>>2,3
Fuck you both. http://en.wikipedia.org/wiki/Wireworld

Name: Anonymous 2009-07-04 4:18

post the code, I love me some automata

Name: Anonymous 2009-07-04 6:00

post the anux, I love me some hax

Name: Anonymous 2009-07-04 19:55

>>6
Meh, it's pretty easy, write Conway's Game of Life and modify the mutation part, that's about it. It's written in Java, /prog/ doesn't like Java.

The only gates that I have left to realize are: the NAND-gate, NOR-gate, NXOR-gate and NOT-gate. Even with the gates above, it's possible to do some cool stuff.

Also, Wireworld is Turing-complete!.

Name: Anonymous 2009-07-04 20:47

A Turing Machine built using Conway's Life:  http://rendell-attic.org/gol/tmdetails.htm

Name: Anonymous 2009-07-04 20:48

>>9
Err, use this link instead: http://rendell-attic.org/gol/tm.htm

Name: Anonymous 2009-07-05 4:30

A Dick Machine built using Conway's Game of Dicks.

Name: Anonymous 2009-07-05 4:37

>>11

ELLLLLL-OOOHHHHHH-ELLLLLL!!!!!!!11 XDXDDXDXDDXDDXDXDXDDXDXDXDDX

Name: Anonymous 2009-07-05 4:41

>>8
NXOR
Silly boy, it's XNOR

Name: Anonymous 2009-07-05 5:21

[color=0xff0000]color tags supported now?[/color]

Name: Anonymous 2009-07-05 5:36

[color=#ff0000]forgot no 0x, this should work[/color]

Name: Anonymous 2009-07-05 6:04

Dearest 15,
"you have misinterpreted" //the situation.

Name: Anonymous 2009-07-05 6:41

[color=#green]"oh i see"[/color]

Name: Anonymous 2009-07-05 8:58

>>17
No, no.
Colourised "TEXT" //is an 'art form.

Name: Anonymous 2009-07-05 12:06

>>18
Colourised "TEXT" is //an art 'form.

Name: Anonymous 2009-07-05 12:08

>>19
Fuck.
Colourised "TEXT" is //an art 'form.
I knew I was forgetting something.

Name: Anonymous 2009-07-05 15:26

>>20
HAX"MY"#ANUS

Name: Anonymous 2009-07-05 15:27



    [color=#green]dassdaasd[/color]

Name: Anonymous 2009-07-05 15:28

[color=green]forgot no 0x, this should work[/color]

Name: Anonymous 2009-07-05 15:29

[color=orange]Example text[/color]

Name: Anonymous 2009-07-05 15:49

[color=penis]' dicks in your mouth '[/color]

Name: Anonymous 2009-07-05 16:45

This one's awesome:
http://www.quinapalus.com/wi-java.html

It's a wireworld computer that computes prime numbers.

Name: Anonymous 2009-07-05 17:01

>>26
You looked through Wikipedia too, didn't you? Also that computer's good, except by the time it had reached 100000 generations it had got up to 3.

Name: Anonymous 2009-07-05 18:04

>>27
If you're interested in cellular automata you should get Golly 2.0 It's an editor and simulator for many different rules.

It also has that prime calculating computer as an example. But the awesome thing is, you can speed shit up and see that the computer actually works.

Name: Anonymous 2009-07-05 18:42

>>28
It's much more fun to program it yourself. Once you get hashlife working, everything is much faster. The question is can it get faster than it already is?

Name: Anonymous 2009-07-05 19:36

>>18-20
Colourised
EXPERT BRITISH ARTIST

Name: Anonymous 2009-07-05 19:41

When I use a logic gate, I don't want one extra LOGICAL OPERATOR of worthless negation!  I just want a NOR or NAND!!
Not a "OR".  Not an "AND".  Those aren't even WORDS!!!!
NOR! NAND! THEY ARE THE STANDARD!!!

Name: Anonymous 2009-07-05 19:51

>>31
NOR isn't a word.
NAND however is. Unless we define word as less or more than 32 bits.

Name: Anonymous 2009-07-05 21:57

>>32
Of course we do, why wouldn't we? 32-bit word architectures are so '90s.

Name: Anonymous 2012-10-11 22:37

New prog challenge: write a program that compiles a useful subset of a HDL (you can make up your own) to a Wireworld program.  Show the usefulness of your compiler by writing a program that computes primes or draws dicks.

Hm, I remember there's someone who found a way to really speed up Conway's game of dicks by using some memoization technique.  I wonder if the same can be done for wireworld.

Name: Anonymous 2012-10-11 22:50

Conway's Game of Dicks is real?

Name: Anonymous 2012-10-11 22:51

>>35
How long ago was that? I bet getting the final result via SIMD will be faster than preparing the LUT key.

Name: Anonymous 2012-11-26 4:48

Conway's game of dicks.
Don't change these.
Name: Email:
Entire Thread Thread List
All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode -