Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2007-10-08
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
Functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Our main concern here is how and under what conditions algorithmic interactive devices can be more powerful than the recursive models of computation, such as Turing machines. Realization of such a higher computing power makes these systems superrecursive. We find here five sources for superrecursiveness in interaction. In addition, we prove that when all of these sources are excluded, the algorithmic interactive system in question is able to perform only recursive computations. These results provide computer scientists with necessary and sufficient conditions for achieving superrecursiveness by algorithmic interactive devices.
Burgin Mark
No associations
LandOfFree
Superrecursive Features of Interactive 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 Superrecursive Features of Interactive Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Superrecursive Features of Interactive Computation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-543546