About the work
In a recent paper I have advanced some conjectures using a coefficient that renders aspects of the qualitative behavior of complex systems in quantitative terms. It measures the sensitivity of a system to external stimuli, its apparent ability to (efficiently) transfer information from the input through the output. In a previous paper, and in a [...]
Print work information
Work information
Title Conjectures concerning Busy Beavers, Dynamic Behavior and Turing Universality
In a recent paper I have advanced some conjectures using a coefficient that renders aspects of the qualitative behavior of complex systems in quantitative terms. It measures the sensitivity of a system to external stimuli, its apparent ability to (efficiently) transfer information from the input through the output. In a previous paper, and in a [...]
Work type Article
Tags computability, foundations of computation, complexity, computer science, universality and unsolvability
-------------------------
Registry info in Safe Creative
Identifier 1206011741874
Entry date Jun 1, 2012, 10:11 PM UTC
License Creative Commons Attribution Non-commercial No Derivatives 3.0
-------------------------
Copyright registered declarations
Author. Holder Hector Zenil Chavez. Date Jun 1, 2012.
Information available at https://www.safecreative.org/work/1206011741874-conjectures-concerning-busy-beavers-dynamic-behavior-and-turing-universality