TY - JOUR
T1 - On the computational power of self-stabilizing systems
AU - Abello, James
AU - Dolev, Shlomi
N1 - Funding Information:
* Corresponding author. E-mail: [email protected]. Part of this work was done while this author was at the department of computer science, Texas A&M University, College Station, TX 77843. Supported in part by TAMU Engineering Excellence funds and NSF Presidential Young Investigator Award CCR-9158478. ’ An extended abstract of this paper was presented at the 6th International Conference on Computing and Information, Canada, May 1994. ’ E-mail: [email protected]. Supported in part by NSF grant CCR-9304081.
PY - 1997/8/15
Y1 - 1997/8/15
N2 - The computational power of self-stabilizing distributed systems is examined. Assuming availability of any number of processors, each with (small) constant size memory we show that any computable problem can be realized in a self-stabilizing fashion. The result is derived by presenting a distributed system which tolerates transient faults and simulates the execution of a Turing machine. The total amount of memory required by the distributed system is equal to the memory used by the Turing machine (up to a constant factor).
AB - The computational power of self-stabilizing distributed systems is examined. Assuming availability of any number of processors, each with (small) constant size memory we show that any computable problem can be realized in a self-stabilizing fashion. The result is derived by presenting a distributed system which tolerates transient faults and simulates the execution of a Turing machine. The total amount of memory required by the distributed system is equal to the memory used by the Turing machine (up to a constant factor).
UR - http://www.scopus.com/inward/record.url?scp=0031210524&partnerID=8YFLogxK
U2 - 10.1016/S0304-3975(96)00150-8
DO - 10.1016/S0304-3975(96)00150-8
M3 - Article
AN - SCOPUS:0031210524
SN - 0304-3975
VL - 182
SP - 159
EP - 170
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 1-2
ER -