Abstract
Using the formalism of Turing machines, efficient deterministic, both sequential and parallel, realizations of nondeterministic computations are described and analyzed. It is shown that when simulating nondeterministic computations by the ring of cooperating Turing machines, the speed-up linear in the number of machines can be achieved as compared to the case of a single machine. Using examples it is argued that the methods and results described in the paper can be applied to more realistic models of computations and thus are of practical significance e.g. in artificial intelligence for solving various combinatorial search problems.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V. — Hopcroft, J.E. — Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974
Bitner, J,R, — Reingold, E.M.: Backtracking program techniques. Comm. ACM, Vol. 18, 1975, pp. 651–655
Hopcroft, J.E. — Ullman, J,D,: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass., 1979
Johnson, D.S. The NP-completeness column: an ongoing guide, Journal of Algorithms, since December 1981
Lloyd, J.W.: Foundations of Logic Programming. Springer-Verlag, 1984
Monien, B. — Speckenmeyer, E. — Vornberger, O.: Superlinear speed-up for parallel backtracking. Technical report, No. 30, Dept. of Comp. Sci., University of Paderborn, 1983
Monien, B. — Vornberger, O.: The ring machine. Computers and Artificial Intelligence, Vol. 6, No.3, 1987, pp. 195–208
Shapiro, E.Y.: Alternation and the computational complexity of logic programs. Journal of Logic Programming, No. 1, 1984, pp. 19–33
van Emde-Boas, P.: Machine models and simulations. In: van Leeuwen, J. (Ed.), Handbook of Theoretical Computer Science, North-Holland, 1990
van Leeuwen, J.: Distributed computing. Technical Report, Dept. of Comp. Sci., Utrecht University, 1983
Vornberger, O.: Implementing branch-and-bound in a ring of processors. Technical Report No. 29, Dept. of Comp. Sci., University of Paderborn, 1986
Wiedermann, J.: Solving the knapsack problem in subexponential time. Proc. 13-th SOF-SEM, Liptovský Ján, 1986, pp. 251–253, (in Slovak)
Wiedermann, J.: Fast simulation of nondeterministic Turing machines with application to the knapsack problem. Computers and Artificial Intelligence, Vol. 8, No. 6, 1989, pp. 591–596
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wiedermann, J. (1991). Efficient simulations of nondeterministic computations and their speed-up by the ring of cooperating machines. In: Jorrand, P., Kelemen, J. (eds) Fundamentals of Artificial Intelligence Research. FAIR 1991. Lecture Notes in Computer Science, vol 535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54507-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-54507-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54507-1
Online ISBN: 978-3-540-38420-5
eBook Packages: Springer Book Archive