Computational Processes and Incompleteness

Details Computational Processes and Incompleteness Computational Processes and Incompleteness

2009-06-17

arxiv.org/abs/0906.3228v1

EPTCS 1, 2009, pp. 226-234

Computer Science

Computational Complexity

Scientific paper

10.4204/EPTCS.1.22

We introduce a formal definition of Wolfram's notion of computational process based on cellular automata, a physics-like model of computation. There is a natural classification of these processes into decidable, intermediate and complete. It is shown that in the context of standard finite injury priority arguments one cannot establish the existence of an intermediate computational process.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-223583