Results 1 to 4 of 4
  1. #1
    christopherx is offline Member
    Join Date
    Oct 2011
    Posts
    92
    Rep Power
    0

    Default Reversible Cellular Automata

    Hey guys. I know this isn't strictly a Java question but this is one of the largest Comp Sci communities im aware of, and you guys tend to have good answers. I'm looking for a set of cellular automata rules that are the mathematical opposites. Essentially, if I took a grid of boolean values, and put it through one iteration of rule "F", Rule "G" would return the grid back to it's original value. I know they exist, or at least I've read that they exist. I'm just stuck on what rules compliment each other. Any help is greatly appreciated!!

  2. #2
    JosAH's Avatar
    JosAH is offline Moderator
    Join Date
    Sep 2008
    Location
    Voorschoten, the Netherlands
    Posts
    13,765
    Blog Entries
    7
    Rep Power
    21

    Default Re: Reversible Cellular Automata

    Quote Originally Posted by christopherx View Post
    Hey guys. I know this isn't strictly a Java question but this is one of the largest Comp Sci communities im aware of, and you guys tend to have good answers. I'm looking for a set of cellular automata rules that are the mathematical opposites. Essentially, if I took a grid of boolean values, and put it through one iteration of rule "F", Rule "G" would return the grid back to it's original value. I know they exist, or at least I've read that they exist. I'm just stuck on what rules compliment each other. Any help is greatly appreciated!!
    If a cellular automaton is defined as c_i = f(c_1, c_2, ... , c_n) then this function f( ... ) needs to be invertible, i.e. it needs to be a bijection; there are many of them; the two most simple functions as:
    c_i= c_i and c_i= ~c_i (~ means the inverse). The domain needs to have the same size as the co-domain of the function f.
    kind regards,

    Jos
    cenosillicaphobia: the fear for an empty beer glass

  3. #3
    christopherx is offline Member
    Join Date
    Oct 2011
    Posts
    92
    Rep Power
    0

    Default Re: Reversible Cellular Automata

    Hey Jos, cheers for the answer. I'm stuck on some of the more mathematical terms :P What on earth is a Bijection?

    I understand the domain of the seed needs to be the same for both of them, for them to be true mathematical inverses. Can you give me an example of two rules that compliment each other in this way?

    Sincerely, Chris.

  4. #4
    JosAH's Avatar
    JosAH is offline Moderator
    Join Date
    Sep 2008
    Location
    Voorschoten, the Netherlands
    Posts
    13,765
    Blog Entries
    7
    Rep Power
    21

    Default Re: Reversible Cellular Automata

    A bijection is an invertible function; for examples of bijections see my previous reply; e.g. f(c) == c and f(c) == ~c are invertible functions (bijections).

    kind regards,

    Jos
    cenosillicaphobia: the fear for an empty beer glass

Similar Threads

  1. cellular automaton (A 1D CA)
    By neshkid123 in forum New To Java
    Replies: 6
    Last Post: 10-14-2011, 10:02 PM
  2. Cellular Automata Update Problem
    By samanyu in forum New To Java
    Replies: 17
    Last Post: 06-17-2011, 08:21 AM
  3. 1-D Cellular Automata
    By cest.lavie16 in forum New To Java
    Replies: 1
    Last Post: 04-25-2011, 08:40 PM
  4. Some help needed: 2D Cellular Automata
    By markus-sukram in forum AWT / Swing
    Replies: 1
    Last Post: 04-27-2008, 09:02 PM
  5. Replies: 1
    Last Post: 03-17-2008, 01:59 AM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •