About the work
In a previous article, I suggested a method for testing the algorithmicity of a natural/physical process using the concept of Levin’s universal distribution. In this new paper published by the Journal of Experimental Artificial Intelligence, I explain this method in the context of the problem formulated by Floridi concerning the testability of pancomputationalism. Then, I introduce a […]
Print work information
Work information
Title Algorithmicity and programmability in natural computing with the Game of Life as in silico case study
In a previous article, I suggested a method for testing the algorithmicity of a natural/physical process using the concept of Levin’s universal distribution. In this new paper published by the Journal of Experimental Artificial Intelligence, I explain this method in the context of the problem formulated by Floridi concerning the testability of pancomputationalism. Then, I introduce a […]
Work type Article
Tags complexity, foundations of computation, computer science, universality and unsolvability, new ideas, algorithmic information theory, computability
-------------------------
Registry info in Safe Creative
Identifier 1409041911235
Entry date Sep 4, 2014, 6:35 PM UTC
License Creative Commons Attribution Non-commercial No Derivatives 3.0
-------------------------
Copyright registered declarations
Author. Holder Hector Zenil Chavez. Date Sep 4, 2014.
Information available at https://www.safecreative.org/work/1409041911235-algorithmicity-and-programmability-in-natural-computing-with-the-game-of-life-as-in-silico-case-study
/
Registration: 1409041911235
