TY - GEN
T1 - Brief announcement
T2 - 31st International Symposium on Distributed Computing, DISC 2017
AU - Afek, Yehuda
AU - Emek, Yuval
AU - Kolikant, Noa
N1 - Publisher Copyright:
© Yehuda Afek, Yuvet almek, and Noa Kolikant;.
PY - 2017/10/1
Y1 - 2017/10/1
N2 - What can be computed by a network of n randomized finite state machines communicating under the stone age model [4] (a generalization of the beeping model's communication scheme)? The inherent linear upper bound on the total space of the network implies that its global computational power is not larger than that of a randomized linear space Turing machine, but is this tight? The reported reseach answers this question affirmatively for bounded degree networks by introducing a stone age algorithm (operating under the most restrictive form of the model) that given a designated I/O node, constructs a tour in the network that enables the simulation of the Turing machine's tape. To construct the tour, it is first shown how to 2-hop color the network concurrently with building a spanning tree, with high probability.
AB - What can be computed by a network of n randomized finite state machines communicating under the stone age model [4] (a generalization of the beeping model's communication scheme)? The inherent linear upper bound on the total space of the network implies that its global computational power is not larger than that of a randomized linear space Turing machine, but is this tight? The reported reseach answers this question affirmatively for bounded degree networks by introducing a stone age algorithm (operating under the most restrictive form of the model) that given a designated I/O node, constructs a tour in the network that enables the simulation of the Turing machine's tape. To construct the tour, it is first shown how to 2-hop color the network concurrently with building a spanning tree, with high probability.
KW - Beeping communication scheme
KW - Distributed network computability
KW - Finite state machines
KW - Stone-age model
UR - http://www.scopus.com/inward/record.url?scp=85032350624&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.DISC.2017.42
DO - 10.4230/LIPIcs.DISC.2017.42
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85032350624
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 31st International Symposium on Distributed Computing, DISC 2017
A2 - Richa, Andrea W.
Y2 - 16 October 2017 through 20 October 2017
ER -