Abstract
Weak parallel machines represent a new class of physically feasible parallel machine models whose prominent representative is the so-called Parallel Turing Machine (PTM) as introduced by the author in 1984. Except PTMs, further members of this class are e.g. various kinds of systolic machines, cellular automata, orthogonal iterative arrays, etc. From the computational point of view the main common feature of weak parallel machines is their ability to perform pipelined computations efficiently, what is used in characterizing the corresponding machine class by so—called Pipelined Computation Thesis. This thesis states that on these machines the period of computation is polynomially related to the space of sequential Turing machine computations.The paper gives a brief overview of the most important known results concerning PTMs and extends them by new results stressing the significance of PTMs in the context of physically feasible parallel computations.KeywordsCellular AutomatonSpace ComplexityTuring MachineInput WordInput TapeThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
