Buchholz, ThomasThomasBuchholzKutrib, MartinMartinKutrib2022-06-301998-06-221996http://nbn-resolving.de/urn:nbn:de:hebis:26-opus-213https://jlupub.ub.uni-giessen.de/handle/jlupub/2215http://dx.doi.org/10.22029/jlupub-1985Relations between various models for massively parallel computers are investigated. These are arrays of finite­state machines -- eventually augmented by pushdown storage -- operating synchronously. The architectures differ mainly in how the input is supplied and how the single nodes are interconnected. The comparisons are made in terms of their capabilities to time­construct and time­compute functions. That means given an constant input of length n a distinguished cell has to enter distinguished states after f(1); : : : ; f(n) respectively f(n) time steps.enIn Copyrightddc:004