Machine Models and Simulations
- 1 January 1990
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 76 references indexed in Scilit:
- Array processing machines: An abstract modelBIT Numerical Mathematics, 1987
- On time versus space IIITheory of Computing Systems, 1986
- A Boolean function requiring 3n network sizeTheoretical Computer Science, 1983
- A note on the ‘parallel computation thesis’Information Processing Letters, 1983
- Physical parallel devices are not much faster than sequential onesInformation Processing Letters, 1983
- Parallel random access machines with powerful instruction setsTheory of Computing Systems, 1981
- Computing a perfect strategy for n × n chess requires time exponential in nJournal of Combinatorial Theory, Series A, 1981
- Tape bounds for time-bounded turing machinesJournal of Computer and System Sciences, 1972
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- Computability of Recursive FunctionsJournal of the ACM, 1963