[ Top page ]

« Software and hardware | Main | Natural-Direction-Consistent 3D-Design and -Printing Methods (self-explanatory version) »

Computation with randomized order

Recently, computation methods with randomness are widely studied. Evolutionary computation including genetic algorithms and genetic programming are examples of such methods. Computation using simulated annealing, such as Bolzmann Machine, and methods for increasing efficiency using randomization in classical algorithms are also studied. The randomized computation models I previous studied, i.e., Chemical Computation Model (CCM) and randomized cellular automata (RACA), also used randomized computation.

In these computation models, computation proceeds by successively applying given rules. The order of rule applications is randomized. Some interesting phenomena occur by regularly (synchronously) applying rules, but regular application often causes unexpected results. Randomness sometimes causes improvement of efficiency. However, I researched the computation methods above rather because, firstly I expected that we might be able to get intended results more easily without using specialized techniques, and secondly I believed that randomness is the source of emergence.

Pages on related researches:
Keywords: CCM, Chemical Casting Model, Chemical Computation Model, Randomized cellular automaton, Asynchronous cellular automaton, Randomized cellular automata, Asynchronous cellular automata, Randomized computation, Emergent computation, Rule-based computation, Rule-based problem solving

Post a comment


This page contains a single entry from the blog posted on March 31, 2007 9:00 AM.

Many more can be found on the main index page or by looking through the archives.

Creative Commons License
This weblog is licensed under a Creative Commons License.
Powered by
Movable Type 3.36