Bureaucrats, emailconfirmed, Administrators
5,476
edits
Line 40: | Line 40: | ||
“Examples of obstacle-avoiding shortest paths computed by Physarum can be found in almost any chapter of the book, e.g. plasmodium propagates towards oat flakes and avoids salty areas of agar” (Adamatzky 2010) | “Examples of obstacle-avoiding shortest paths computed by Physarum can be found in almost any chapter of the book, e.g. plasmodium propagates towards oat flakes and avoids salty areas of agar” (Adamatzky 2010) | ||
* Adamatzky A. Physarum machine: implementation of a Kolmogorov–Uspensky machine on a biological substrate. (Adamatzky 2007) | |||
== Computable Discrete Elements in the Turing Machine == | == Computable Discrete Elements in the Turing Machine == |