« previous next »
Pages: [1]   Go Down

Author Topic: Cellular automata  (Read 7281 times)

0 Members and 1 Guest are viewing this topic.

Offline AngelFish

  • Is this my custom title?
  • Administrator
  • LV12 Extreme Poster (Next: 5000)
  • ************
  • Posts: 3242
  • Rating: +270/-27
  • I'm a Fishbot
    • View Profile
Cellular automata
« on: January 30, 2011, 06:36:56 pm »
Does anyone have an interesting CA that they like?

This is one of my favorite 1D CA (because of its Turing completeness) and it was generated by the first Axe program I ever made. Rule 110:

Logged
∂²Ψ    -(2m(V(x)-E)Ψ
---  = -------------
∂x²        ℏ²Ψ

Offline Galandros

  • LV9 Veteran (Next: 1337)
  • *********
  • Posts: 1140
  • Rating: +42/-10
    • View Profile
Re: Cellular automata
« Reply #1 on: January 30, 2011, 06:40:23 pm »
That one is interesting, although I haven't fully understand how it can be turing complete. Never thought/read much about it though. Just saw somewhere it was turing complete and I know in a intuitive way what is turing complete.
Logged
Hobbing in calculator projects.

Offline jnesselr

  • King Graphmastur
  • LV11 Super Veteran (Next: 3000)
  • ***********
  • Posts: 2270
  • Rating: +81/-20
  • TAO == epic
    • View Profile
Re: Cellular automata
« Reply #2 on: January 30, 2011, 06:56:40 pm »
I like Rule 90.
Logged

Offline calcdude84se

  • Needs Motivation
  • LV11 Super Veteran (Next: 3000)
  • ***********
  • Posts: 2272
  • Rating: +78/-13
  • Wondering where their free time went...
    • View Profile
Re: Cellular automata
« Reply #3 on: February 01, 2011, 08:53:08 pm »
I like Rule 30. Deterministic randomness FTW.
Game of life is great too.
Logged
"People think computers will keep them from making mistakes. They're wrong. With computers you make mistakes faster."
-Adam Osborne
Spoiler For "PartesOS links":
I'll put it online when it does something.

Offline willrandship

  • Omnimagus of the Multi-Base.
  • LV11 Super Veteran (Next: 3000)
  • ***********
  • Posts: 2953
  • Rating: +98/-13
  • Insert sugar to begin programming subroutine.
    • View Profile
Re: Cellular automata
« Reply #4 on: September 20, 2011, 11:24:46 pm »
Wireworld Rocks!
Logged

Offline AngelFish

  • Is this my custom title?
  • Administrator
  • LV12 Extreme Poster (Next: 5000)
  • ************
  • Posts: 3242
  • Rating: +270/-27
  • I'm a Fishbot
    • View Profile
Re: Cellular automata
« Reply #5 on: September 21, 2011, 12:57:11 am »
Quote from: Galandros on January 30, 2011, 06:40:23 pm
That one is interesting, although I haven't fully understand how it can be turing complete. Never thought/read much about it though. Just saw somewhere it was turing complete and I know in a intuitive way what is turing complete.

As it turns out, Rule 110 has "structures" that can propagate down the grid at different angles. The multiple structures at different angles allow for "collisions" which can be placed properly to simulate other automata. That's basically how the proof goes.
Logged
∂²Ψ    -(2m(V(x)-E)Ψ
---  = -------------
∂x²        ℏ²Ψ

Offline Spyro543

  • LV9 Veteran (Next: 1337)
  • *********
  • Posts: 1189
  • Rating: +74/-3
    • View Profile
Re: Cellular automata
« Reply #6 on: September 21, 2011, 06:21:08 am »
Er, that is not 1D though in your pic at the top of this thread.
Logged

Offline AngelFish

  • Is this my custom title?
  • Administrator
  • LV12 Extreme Poster (Next: 5000)
  • ************
  • Posts: 3242
  • Rating: +270/-27
  • I'm a Fishbot
    • View Profile
Re: Cellular automata
« Reply #7 on: September 21, 2011, 09:42:12 am »
The rule is 1D in that only the current state of the system (a 1D line of pixels in that representation) is used to compute the next state of the system. The picture itself isn't 1D, but instead shows the evolution of the system over time.
Logged
∂²Ψ    -(2m(V(x)-E)Ψ
---  = -------------
∂x²        ℏ²Ψ

Offline yunhua98

  • You won't this read sentence right.
  • LV11 Super Veteran (Next: 3000)
  • ***********
  • Posts: 2718
  • Rating: +214/-12
  • Go take a dive in the River Lethe.
    • View Profile
Re: Cellular automata
« Reply #8 on: September 21, 2011, 05:02:22 pm »
Quote from: Qwerty.55 on January 30, 2011, 06:36:56 pm
Does anyone have an interesting CA that they like?

This is one of my favorite 1D CA (because of its Turing completeness) and it was generated by the first Axe program I ever made. Rule 110:



lol, That was my first Axe Program as well that I made with all the code being mine.!  ;)
« Last Edit: September 21, 2011, 05:02:38 pm by yunhua98 »
Logged

Spoiler For =====My Projects=====:
Minor setback due to code messing up.  On hold for Contest.
<hr>
On hold for Contest.


Spoiler For ===Staff Memberships===:






Have you seen any good news-worthy programs/events?  If so, PM me with an article to be included in the next issue of CGPN!
The Game is only a demo, the code that allows one to win hasn't been done.
To paraphrase Oedipus, Hamlet, Lear, and all those guys, "I wish I had known this some time ago."
Signature Last Updated: 12/26/11
<hr>

Offline Spyro543

  • LV9 Veteran (Next: 1337)
  • *********
  • Posts: 1189
  • Rating: +74/-3
    • View Profile
Re: Cellular automata
« Reply #9 on: September 21, 2011, 05:32:43 pm »
* Spyro543 likes standard Game of Life.

But Seeds is pretty cool too.

(Powder Toy is an awesome cellular automata emulator. It has tons of types of automata.)
Logged

Offline flyingfisch

  • I'm 1337 now!
  • Members
  • LV10 31337 u53r (Next: 2000)
  • **********
  • Posts: 1620
  • Rating: +94/-17
  • Testing, testing, 1...2...3...4...5...6...7...8..9
    • View Profile
    • Top Page Website Design
Re: Cellular automata
« Reply #10 on: September 21, 2011, 05:35:29 pm »
I like Game of Life and amoeba. <- I think amoeba is rule 0? I'll have to check.
Logged



Quote from: my dad
"welcome to the world of computers, where everything seems to be based on random number generators"



The Game V. 2.0

Offline willrandship

  • Omnimagus of the Multi-Base.
  • LV11 Super Veteran (Next: 3000)
  • ***********
  • Posts: 2953
  • Rating: +98/-13
  • Insert sugar to begin programming subroutine.
    • View Profile
Re: Cellular automata
« Reply #11 on: September 23, 2011, 06:33:58 pm »
Dang, I always thought this was powder toy :P thanks for also providing a link!

http://dan-ball.jp/en/javagame/dust/

I love using golly to mess with Generations (multiple stages of life, rules are a little weird, up to 256 stages) and making fascinating wireworld-esque creations.
« Last Edit: September 23, 2011, 06:34:58 pm by willrandship »
Logged
Pages: [1]   Go Up
« previous next »