Intrinsically Universal Cellular Automata

Details Intrinsically Universal Cellular Automata Intrinsically Universal Cellular Automata

2009-06-17

arxiv.org/abs/0906.3213v1

EPTCS 1, 2009, pp. 199-204

Computer Science

Computational Complexity

Scientific paper

10.4204/EPTCS.1.19

This talk advocates intrinsic universality as a notion to identify simple cellular automata with complex computational behavior. After an historical introduction and proper definitions of intrinsic universality, which is discussed with respect to Turing and circuit universality, we discuss construction methods for small intrinsically universal cellular automata before discussing techniques for proving non universality.

Affiliated with

Also associated with

No associations

Rating

Intrinsically Universal Cellular Automata 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 Intrinsically Universal Cellular Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Intrinsically Universal Cellular Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-223509