GMU:BioArt WS15/Physarum polycephalum and unconventional computing: Difference between revisions
From Medien Wiki
No edit summary |
|||
| Line 90: | Line 90: | ||
* Andrew Adamatzky (2010). Physarum Machines: Computers from Slime Mould. World Scientific Publishing. Partly available at: https://books.google.de/books?id=Kbs_AIDbfU8C&printsec=frontcover (Accessed 8 December 2015). | * Andrew Adamatzky (2010). Physarum Machines: Computers from Slime Mould. World Scientific Publishing. Partly available at: https://books.google.de/books?id=Kbs_AIDbfU8C&printsec=frontcover (Accessed 8 December 2015). | ||
* John Bonner. Available at: https://www.youtube.com/watch?v=bkVhLJLG7ug&list=PLb14u5e_rEcSVd0ZjgEFHuggA6y7ozQQI (Accessed 8 December 2015). | * John Bonner. Available at: https://www.youtube.com/watch?v=bkVhLJLG7ug&list=PLb14u5e_rEcSVd0ZjgEFHuggA6y7ozQQI (Accessed 8 December 2015). | ||
* Yuri Gurevich. On Kolmogorov Machines And Related Issues | * Yuri Gurevich (1988). On Kolmogorov Machines And Related Issues. Available at: http://research.microsoft.com/en-us/um/people/gurevich/opera/78.pdf (Accessed 8 December 2015). | ||
А. Н. Колмогоров и В. А. Успенский (1958). “К ОПРЕДЕЛЕНИЮ АЛГОРИТМА”, УСПЕХИ МАТЕМАТИЧЕСКИХ НАУК, т. XIII, вып. 4 (82). Available at http://lpcs.math.msu.su/~uspensky/bib/Uspensky_1958_UMN_Kolmogorov_Opredelenie_algoritma.pdf (Accessed 8 December 2015). | * А. Н. Колмогоров и В. А. Успенский (1958). “К ОПРЕДЕЛЕНИЮ АЛГОРИТМА”, УСПЕХИ МАТЕМАТИЧЕСКИХ НАУК, т. XIII, вып. 4 (82). Available at http://lpcs.math.msu.su/~uspensky/bib/Uspensky_1958_UMN_Kolmogorov_Opredelenie_algoritma.pdf (Accessed 8 December 2015). | ||
* Emil Post (1036). Finite Combinatory Processes-Formulation 1. Available at: https://www.wolframscience.com/prizes/tm23/images/Post.pdf (Accessed 8 December 2015). | * Emil Post (1036). Finite Combinatory Processes-Formulation 1. Available at: https://www.wolframscience.com/prizes/tm23/images/Post.pdf (Accessed 8 December 2015). | ||
* Turing, A. M. (1936). “On computable numbers, with an application to the Entscheidungsproblem,” in Proceedings of the London mathematical society, 2(42), pp. 230-265. Available at: http://www.dna.caltech.edu/courses/cs129/caltech_restricted/Turing_1936_IBID.pdf (Accessed 8 December 2015). | * Turing, A. M. (1936). “On computable numbers, with an application to the Entscheidungsproblem,” in Proceedings of the London mathematical society, 2(42), pp. 230-265. Available at: http://www.dna.caltech.edu/courses/cs129/caltech_restricted/Turing_1936_IBID.pdf (Accessed 8 December 2015). | ||