Computability in amorphous structures
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 0302-9743, Vol: 4497 LNCS, Page: 781-790
2007
- 7Citations
- 1Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Conference Paper Description
Amorphous computing differs from the classical ideas about computations almost in every aspect. The architecture of amorphous computers is random, since they consist of a plethora of identical computational units spread randomly over a given area. Within a limited radius the units can communicate wirelessly with their neighbors via a singlechannel radio. We consider a model whose assumptions on the underlying computing and communication abilities are among the weakest possible: all computational units are finite state probabilistic automata working asynchronously, there is no broadcasting collision detection mechanism and no network addresses. We show that under reasonable probabilistic assumptions non-uniform families of such amorphous computers can possess universal computing power with a high probability. To the best of our knowledge this is the first result showing the universality of such computing systems. © Springer-Verlag Berlin Heidelberg 2007.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=38149006896&origin=inward; http://dx.doi.org/10.1007/978-3-540-73001-9_83; http://link.springer.com/10.1007/978-3-540-73001-9_83; http://link.springer.com/content/pdf/10.1007/978-3-540-73001-9_83; https://dx.doi.org/10.1007/978-3-540-73001-9_83; https://link.springer.com/chapter/10.1007/978-3-540-73001-9_83; http://www.springerlink.com/index/10.1007/978-3-540-73001-9_83; http://www.springerlink.com/index/pdf/10.1007/978-3-540-73001-9_83
Springer Nature
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know