Computer Science – Computational Complexity
Scientific paper
2012-01-04
Computer Science
Computational Complexity
forthcoming in Complex Systems vol. 20
Scientific paper
We explore the possible connections between the dynamic behaviour of a system and Turing universality in terms of the system's ability to (effectively) transmit and manipulate information. Some arguments will be provided using a defined compression-based transition coefficient which quantifies the sensitivity of a system to being programmed. In the same spirit, a list of conjectures concerning the ability of Busy Beaver Turing machines to perform universal computation will be formulated. The main working hypothesis is that universality is deeply connected to the qualitative behaviour of a system, particularly to its ability to react to external stimulus--as it needs to be programmed--and to its capacity for transmitting this information.
No associations
LandOfFree
On the Dynamic Qualitative Behaviour of Universal Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Dynamic Qualitative Behaviour of Universal Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Dynamic Qualitative Behaviour of Universal Computation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-156232