|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Phase-5 illustration: parallel 1D Wolfram rule 30 / 110. More...
#include <array>#include <cstdint>#include <cstdio>#include <ca-bench.H>#include <ca-traits.H>#include <tpl_ca_engine.H>#include <tpl_ca_lattice.H>#include <tpl_ca_neighborhood.H>#include <tpl_ca_parallel_engine.H>#include <tpl_ca_rule.H>#include <tpl_ca_storage.H>Go to the source code of this file.
Typedefs | |
| using | Lat_t = Lattice< Dense_Cell_Storage< int, 1 >, OpenBoundary > |
Functions | |
| int | main () |
Phase-5 illustration: parallel 1D Wolfram rule 30 / 110.
Runs two of the most famous elementary CAs (rule 30, the canonical "computational chaos" rule, and rule 110, Cook-proven Turing complete) on a wide 1D lattice using the parallel synchronous engine. Prints the first 32 generations as ASCII art plus a side benchmark comparing the parallel engine to the sequential one.
Definition in file ca_parallel_wolfram_example.cc.
| using Lat_t = Lattice<Dense_Cell_Storage<int, 1>, OpenBoundary> |
Definition at line 58 of file ca_parallel_wolfram_example.cc.
| int main | ( | void | ) |
Definition at line 136 of file ca_parallel_wolfram_example.cc.
References Aleph::blossom_maximum_cardinality_matching().