GMU:BioArt WS15/Physarum polycephalum and unconventional computing: Difference between revisions

← Older edit

GMU:BioArt WS15/Physarum polycephalum and unconventional computing (view source)

Revision as of 17:12, 11 July 2018

515 bytes removed , 11 July 2018

→‎Projects

Miga

Bureaucrats, emailconfirmed, Administrators

5,664

edits

@@ Line 33: / Line 33: @@
 == Physarum Machine ==
-* [https://www.youtube.com/watch?v=2UxGrde1NDA Toshiyuki Nakagaki. 3-5 min @ Heather Barnett: What humans can learn from semi-intelligent slime]
+* [https://www.youtube.com/watch?v=2UxGrde1NDA Toshiyuki Nakagaki. 3-5 min]
 "Unconventional computing is an interdisciplinary of science where computer scientists, physicists, mathematicians, apply principles of information processing in natural systems to design novel computer devices and architectures" (Adamatzky 2007)
@@ Line 55: / Line 55: @@
 === Kolmogorov Machine ===
-"Random-access machine (RAM) is an abstract machine in the general class of register machines." (wikipedia (c))
+"Kolmogorov, or Kolmogorov-Uspensky, machines [Ko1, KU, US] are similar to Turing machines except that the tape can change its topology."(Gurevich) Also, as far as I understand, Kolmogorov Machine isn't described by discrete 0 and 1 values. Also its functions could be updated in real time over the recursive method. On the other hand both Turing Machine and Kolmogorov machine, could emulate each other, so at the end the difference is just in the way how the machines compute their functions.
-"The RAM's equivalent of the universal Turing machine – with its program in the registers as well as its data – is called the random-access stored-program machine or RASP. It is an example of the so-called von Neumann architecture and is closest to the common notion of computer."(wikipedia (c))
-"Together with the Turing machine and counter-machine models, the RAM and RASP models are used for computational complexity analysis. Van Emde Boas (1990) calls these three plus the pointer machine "sequential machine" models, to distinguish them from "parallel random-access machine" models."(wikipedia (c))
-"Kolmogorov, or Kolmogorov-Uspensky, machines [Ko1, KU, US] are similar to Turing machines except that the tape can change its topology."(Gurevich)
 "Мы остановимся на следующих вариантах математического опреде ления вычислимой функции или алгоритма:
@@ Line 93: / Line 87: @@
 https://www.youtube.com/watch?v=4sp9Efokv4o
-. Toshiyuki Nakagaki. 3-5 min @ Heather Barnett: What humans can learn from semi-intelligent slime https://www.youtube.com/watch?v=2UxGrde1NDA
+. Toshiyuki Nakagaki. 3-5 min https://www.youtube.com/watch?v=2UxGrde1NDA
 == References ==