Symbolic systems set up simple idealizations of iterations of replacement rules in Mathematica. For example, ... , where ... can be any symbol, and ... and ... can be any expressions, says to replace the pattern on the left by what is on the right. For example, using the initial condition for this Demonstration, in the expression ... , ... is ... , ... is ... , and the result is then ... . Any single rule may be used; another might be ... , and so forth (the eight rules used in this Demonstration are listed below in "Details"). Starting with the initial condition, each expression is the result of applying the rule to the previous expression, replacing all instances of the pattern. In the array, these expressions are reduced by dropping ... —for instance, the expression ... becomes ... —and mapping the opening and closing parentheses " ... " and " ... " to black and gray cells. The Demonstration shows the evolution of eight different rules as an array in the lower part, the plot of steps versus step lengths at the top left, and a detailed version of the first five steps of the evolution at the top right.


    Education Levels:


      EUN,LOM,LRE4,work-cmr-id:398139,http://demonstrations.wolfram.com:http://demonstrations.wolfram.com/SymbolicSystems/,ilox,learning resource exchange,LRE metadata application profile,LRE


      Access Privileges:

      Public - Available to anyone

      License Deed:

      Creative Commons Attribution 3.0


      This resource has not yet been aligned.
      Curriki Rating
      'NR' - This resource has not been rated
      'NR' - This resource has not been rated

      This resource has not yet been reviewed.

      Not Rated Yet.

      Non-profit Tax ID # 203478467