Algorithmically universal model of structureless parallelism
Katya O. Gorbunova · 2003
A new formal model of parallel computations, the Kirdin kinetic machine (1997), is suggested. It is expected that this model will play the role for parallel computations similar to Markov normal algorithms, Kolmogorov and Turing machine or Post schemes for sequential computations. The basic ways in which computations are realized are described; correctness of the elementary programs for the Kirdin kinetic machine is investigated. It is proved that the determined Kirdin kinetic machine is an effective calculator. A simple application of the Kirdin kinetic machine, heap encoding, is suggested. Subprograms similar to usual programming enlarge the Kirdin kinetic machine.