A New Kind of Science: The NKS Forum

• Fun thing to do; Advice to NASA; Disproof of calculus
• Four Layers of Equals
• A semicontinuous cellular automaton
• CA Growth Rates: A Live Experiment
• Recursive enumerable set
• Objective criterion for 'complex' status ?
• Tues., 28 JUN 05 (I)
• Small 'Garden of Eden' patterns?
• Dots and lines.
• I need a demonstration for the universal computation of cellular automata
• Cellular Automata with Live Input
• genetic algorithm fitness function
• Questions from a new user
• Cycle with Transient-like Appearance
• Tiled CA program
• I think I found something?
• Clarification
• Complex & Chaotic
• periodic rule
• More Busy Beaver Turing machines
• NFAs and Multiway Systems
• state of NKS?
• Classes of CA
• Thank you
• 2D CA Rules (regular and totalistic) help
• How to find a "useful" CA ?
• Wolfram's interpretation of Godel's theorem?
• Busy Beaver S(3,3)>=29,403,894
• 3d Question About page 182 and 173
• Star trails, instants, and instances
• Causal precursors in k=3 r=1
• Rule Number 4067213884 ;)
• Question About page 121
• NKS 2004: Olu Lafe, General Features of W-Rule Cellular Automata
• recursive slinky?
• How to find the rule(s) of a CA looking image ?
• The 17c/45 Caterpillar spaceship
• New Question about Rule 122R
• Hybrid Classes
• Skipping rows and columns
• Alternating Rules
• Understanding universal computers
• Does PCE imply a "universal problem space?"
• Where are ALL the additive rules?
• A Simple CA Model for our Universe
• How do programs run without a computer?
• NKS book correction
• Space and Networks
• Why all the triangles?
• Hashing
• Nested box from rule 6 of one-neighbor CA
• Characterizing irreducible computations
• Extended Essay
• Second Order Rules
• Announcing a new simpler evolving network
• Rotating Ring Torus
• Question on Mechanisms of Randomness
• some cycles in rule 54
• Huffman codes' connection with Fibonacci and Lucas numbers
• Relations In General
• Solving Trouble...
• Maximize in Mathematica 4
• Question about School
• Is this discovery new?
• Complementary Klein Bottles
• Functional Logic
• Complementary Rules
• Cells, precursors, and the many to one mapping relation
• Turing Machine to Train Sets Converter
• rule30: wrap? Or no wrap?
• CA as a modeling language, but not quite new
• PSPACE: explanantion?
• Markov Machines
• Predecessor state to simple conditions
• Three components of a Universal Turing Machine
• Local correlations in ECAs
• Functions to find the predecessor states of a given CA state
• Numerics and precision
• precision of random numbers
• Check this out!
• Fibonacci colors
• Work with argument of Maximize?
• 256 rules and Clifford algebra
• Mathematica graphics functions for cellular automata
• Question on 122R
• Persistent Structure Networks
• Time series from CAs and ICAs
• NKS 2004: Pedro de Oliveira, Where Are the Good CA Rules for the Density...
• Random Walks Plot
• Don't cares
• Problem with loops in Mathematica
• NKS 2004: Nigel Goldenfeld, Computational Irreducibility and the Predictability...
• Java applet for coarse-graining cellular automata
• Binary Numbers & the Replicator CA
• Dynamics And Logic
• Propositions As Types
• ICAs for continual interaction with an external environment
• Mathematica programmer
• Variety And Regulation
• GCAs for rule transitions
• Algorithm vs rule
• Validity of the principle of computational equivalence
• Differential Analytic Turing Automata
• human language
• Two components of a Universal Turing Machine
• A comment about Page 1119
• A comment about Page 948
• 2D Turing Machines, 50th anniversary of Turing's death
• A comment about Page 24
• Rule 90, 30, 110
• The 100-year Quantum
• “Quantum” computing?
• NKS 2004: Michael Schreiber, Computational Equivalence: Spencer-Brown Form 110
• folding machines
• Getting Class 3 and 4 Behavior from a Class 2 Three Color Rule
• Long-Range Cellular Automata
• Grid Computing
• Propositional Equation Reasoning Systems
• NKS 2004: Jeremy Smith, RandScape: Some Algorithms for Self-Organizing Patterns
• Modulo 3 Four Variable CAs with Palindromic Initial Conditions
• variations on basic rules
• quantum gravity with constants
• Reductions Among Relations
• NKS 2004: Seth Chandler, GCANs: Global Cellular Automaton Networks
• Cellular Automata with Modulo 3 Algebraic Rules
• NKS 2004: Jesse Clark, The Complexity of Reversible Cellular Automata on Infinite...
• NKS 2004: Eric Rowland, Fibonacci Numbers and Binomial Coefficients Mod n
• NKS 2004: Brenton Bostick, An NKS Approach to the 3n+1 Problem
• NKS 2004: Christopher Maes, Complex Behavior in Digit Sequences...
• NKS 2004: Joshua Schwartzstein, Studying the Effects of Perturbations...
• NKS 2004: Live Computer Experiment by Stephen Wolfram
• NKS 2004: David Hillman, Combinatorial Dynamics
• NKS 2004: Frederico Meinberg, Studying Simple Symbolic Systems
• NKS 2004: Victor Trafaniuc, Explicit Formulation to the Regular Language Complexity..
• NKS 2004: Genaro Martinez, A Way to Construct Complex Configurations in Rule 110
• NKS 2004: Dimitry Gashinsky, Symbolic Dissection of Cellular Automaton Rule 110
• NKS 2004: Veikko Keränen, Avoiding Abelian Patterns in Words
• NKS 2004: Bahman Kalantari, Polynomiography: Visualization of Polynomial Equations...
• NKS 2004: Ed Pegg Jr., Integer Complexity
• NKS 2004: Jiri Kroc, Cellular Automaton Performing Two-Coloring
• NKS 2004: Richard Phillips, Growth of the Boundaries of Simple Cellular Automata
• Proofs : Propositions :: Terms : Types
• topology-limits-computability via NKS
• Where is this leading us?
• Am I getting this right
• examples of P vs. E growth
• Computational irreducibility and Classes 3 and 4
• NKSX Examples
• Cactus Rules
• TM->Rule110 Converter in Java
• When Equivalent Behavior of Elementary Cellular Automata Is Not
• Negate, Augment, Denominate
• NKS explorer mathematica kit
• Physical Review Letters paper on Course Graining CAs
• Simple Symbolic Systems
• Mathematica Help Required
• Graphic Addition
• Colliding CAs
• WireWorld Turing machines
• rules based on modular forms
• stretched rule 30
• CellularAutomaton
• K=2, R=1 Totalistic Rules 6 and 9
• Crossing Programs
• modelling bicycle racing with cellular automata
• randomness
• CAs that perform computations
• Spencer Brown, NOR and NAND
• few simple programs per natural phenomenon
• inverted output & that triangle!
• Structure types (in Baez's TWF)
• CAs with Equivalences of Their Rules
• basic mirror symmetry
• CA with Algebraic System Rules and Cells
• Graduate work in NKS
• Mandelbrot / Julia / and Julius Ruis Set
• Finite Lattice Transistion Diagrams
• Jacquard loom patterns
• Crochet / beading pattern for Codes 966 / 912
• Embroidery machine cellular automaton?
• Computational Equivalence-Page 6
• Note of the week - 1
• Interesting rule
• Cellular automata based on groups
• A comment about Page 204: multiway systems
• Analogue Non-CA images from simple initial conditions
• CA Causal Networks
• universal computation in Life
• Complexity and simplicity in optimal solutions
• Downloadable Model of possible Relativity and Quantum resolution
• Another CA XMas tree
• Handling borders/Nil initial configurations
• complexity <=> irreducibility
• complexity <=> universality
• Pretty Creature
• flip rules
• A cool Fibonacci picture
• CA Xmas Tree
• Rewriting Systems
• r=1/2, k=2, second order rules

Forum Sponsored by Wolfram Research

© 2004-2008 Wolfram Research, Inc. | Powered by vBulletin 2.3.0 © 2000-2002 Jelsoft Enterprises, Ltd. | Disclaimer
vB Easy Archive Final - Created by Xenon and modified/released by SkuZZy from the Job Openings