Models of Massive Parallelism: Analysis of Cellular Automata and Neural Networks
63,90 €
Turing Computability and Complexity. - 1.1 Models of Sequential Computation. - 1.2 Complexity. - 1.3 Cellular Machines. - 1.4 Prerequisites. Cellular Automata. - 2.1 Finite-State Automata. - 2.2 Regular Graphs.
Jetzt bei Ebay:
