Division in Idealized Unit Cost RAMS

Abstract We study the power of RAM acceptors with several instruction sets. We exhibit several instances where the availability of the division operator increases the power of the acceptors. We also show that in certain situations parallelism and stochastic features (“distributed random choices”) are provably more powerful than either parallelism or randomness alone. We relate the class of probabilistic Turing machine computations to random access machines with multiplication (but without boolean vector operations). Again, the availability of integer division seems to play a crucial role in these results.

[1]  K. Ramachandra,et al.  Vermeidung von Divisionen. , 1973 .

[2]  Larry J. Stockmeyer,et al.  A Characterization of the Power of Vector Machines , 1976, J. Comput. Syst. Sci..

[3]  Walter J. Savitch,et al.  Time Bounded Random Access Machines with Parallel Processing , 1979, JACM.

[4]  Janos Simon,et al.  On the Difference Between One and Many (Preliminary Version) , 1977, ICALP.

[5]  Leslie M. Goldschlager,et al.  A unified approach to models of synchronous parallel machines , 1978, STOC.

[6]  John Gill,et al.  Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine Transducers , 1980, Theor. Comput. Sci..

[7]  Dana S. Scott.  Some Definitional Suggestions for Automata Theory , 1967, J. Comput. Syst. Sci..

[8]  John Gill,et al.  Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..

[9]  Juris Hartmanis,et al.  On the Power of Multiplication in Random Access Machines , 1974, SWAT.

[10]  Arnold Schönhage,et al.  On the Power of Random Access Machines , 1979, ICALP.

[11]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[12]  Janos Simon.  On some central problems in computational complexity , 1975 .

[13]  Dexter Kozen,et al.  On parallelism in turing machines , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[14]  Janos Simon.  Division is good , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[15]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..