Contents -- Preface -- Acknowledgments -- 1. From reaction-diffusion to Physarum computing -- 1.1 Reaction-diffusion computers -- 1.2 Limitations of reaction-diffusion computers -- 1.3 Physarum polycephalum -- 1.4 Physarum as encapsulated reaction-diffusion computer -- 1.5 Dawn of Physarum computing -- 2. Experimenting with Physarum -- 2.1 Where to get plasmodium of P. polycephalum -- 2.2 Physarum farms -- 2.3 Dishes and scanners -- 2.4 Data input with food -- 2.5 Substrates -- 2.6 Nutrient-rich vs. non-nutrient substrates -- 2.7 Sensing -- 2.8 Modeling plasmodium -- 2.9 Summary -- 3. Physarum solves mazes -- 3.1 Multiple-site start -- 3.2 Single-site start -- 3.3 Summary -- 4. Plane tessellation -- 4.1 The ubiquitous diagram -- 4.2 Physarum construction of Voronoi diagram -- 4.3 Summary -- 5. Oregonator model of Physarum growing trees -- 5.1 What a BZ medium could not do -- 5.2 Physarum and Oregonator -- 5.3 Building trees with Oregonator -- 5.4 Validating simulation by experiments -- 5.5 Summary -- 6. Does the plasmodium follow Toussaint hierarchy? -- 6.1 Proximity graphs -- 6.1.1 Nearest-neighborhood graph -- 6.1.2 Minimal spanning tree -- 6.1.3 Relative neighborhood graph -- 6.1.4 Gabriel graph -- 6.1.5 Delaunay triangulation -- 6.1.6 Toussaint hierarchy -- 6.2 Plasmodium network and Toussaint hierarchy -- 6.3 Preparing for graph growing -- 6.4 Growing graph from a single point -- 6.5 Growing from all points -- 6.6 Physarum hierarchy -- 6.7 Summary -- 6.7.1 Complexity of plasmodium computation -- 6.7.2 Halting problem -- 6.7.3 Reusability -- 6.7.4 Further studies -- 7. Physarum gates -- 7.1 xor gate anyone? -- 7.2 Ballistics of Physarum localizations -- 7.3 Physarum gates -- 7.4 Simulation of Physarum gates -- 7.5 Simulated one-bit half-adder -- 7.6 Why do we use a non-nutrient substrate? -- 7.7 Summary.

8. Kolmogorov-Uspensky machine in plasmodium -- 8.1 Physarum machines -- 8.1.1 Materials for Physarum machine -- 8.1.2 Nodes -- 8.1.3 Edges -- 8.1.4 Data, results and halting -- 8.1.5 Active zone -- 8.1.6 Bounded connectivity -- 8.1.7 Addressing and labeling -- 8.1.8 Basic operations -- 8.2 Example of Physarum machine solving simple task -- 8.3 On parallelism -- 8.4 Summary -- 9. Recon guring Physarum machines with attractants -- 9.1 Fusion and multiplication of active zones -- 9.2 Translating active zone -- 9.3 Recon guration of Physarum machine -- 9.4 Summary -- 10. Programming Physarum machines with light -- 10.1 Physarum and light -- 10.2 Designing control domains -- 10.3 Trees and waves -- 10.4 Diverting plasmodium -- 10.5 Inertia -- 10.6 Multiplying plasmodium waves -- 10.7 Foraging around obstacles -- 10.8 Routing signals in Physarum machine -- 10.9 Disobedience -- 10.10 Summary -- 11. Routing Physarum with repellents -- 11.1 Avoiding repellents on nutrient-rich substrate -- 11.2 Operating on non-nutrient substrate -- 11.3 Operation deflect -- 11.4 Operation multiply -- 11.5 Operation merge -- 11.6 Summary -- 12. Physarum manipulators -- 12.1 Plasmodium on water surface -- 12.2 Manipulating oating objects -- 12.3 Summary -- 13. Physarum boats -- 13.1 Random wandering -- 13.2 Sliding -- 13.3 Pushing -- 13.4 Anchoring -- 13.5 Propelling -- 13.6 Cellular automaton model -- 13.7 Physarum tugboat -- 13.8 On failures -- 13.9 Summary -- 14. Manipulating substances with Physarum machine -- 14.1 Operations with colored substances -- 14.2 Transfer of substances to speci ed location -- 14.3 Mixing substances -- 14.4 Superpositions of transfer and mix operations -- 14.5 Summary -- 15. Road planning with slime mould -- 15.1 United Kingdom in a gel -- 15.2 Development of transport links -- 15.3 Weighted Physarum graphs.

15.4 Physarum vs. Department for Transport -- 15.5 Proximity graphs and motorways -- 15.6 Imitating disasters -- 15.7 Summary -- Epilogue -- Bibliography -- Index.