Abstract
We investigate the descriptional complexity of little resources added to deterministic one-dimensional real-time iterative arrays. More precisely, we study the impact of adding sublinearly more time obtaining time complexities strictly in between real time and linear time, adding dimensions, allow the communication cell to perform a few nondeterministic steps, and increase the number of bits that may be communicated to neighboring cells slightly. In all cases it is shown that there are arbitrary savings in the size of the descriptions of the arrays which cannot be bounded by any computable function. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Kutrib, M., & Malcher, A. (2012). Iterative arrays: Little resources big size impact. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7495 LNCS, pp. 42–51). Springer Verlag. https://doi.org/10.1007/978-3-642-33350-7_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
