Borodin, A.; Cook, S.; Pippenger, N. Parallel computation for well-endowed rings and space-bounded probabilistic machines. (English) Zbl 0598.68043 Inf. Control 58, 113-136 (1983). MSC: 68Q05 68Q25 16W99 03D10 03D15 15B51 PDFBibTeX XMLCite \textit{A. Borodin} et al., Inf. Control 58, 113--136 (1983; Zbl 0598.68043) Full Text: DOI
Borshchev, V. B. Schemes on club systems and the vegetative machine. (Russian) Zbl 0584.68069 Semiotika Inf. 22, 3-44 (1983). Reviewer: T.Jucan MSC: 68Q05 68Q65 68N99 PDFBibTeX XMLCite \textit{V. B. Borshchev}, Semiotika Inf. 22, 3--44 (1983; Zbl 0584.68069)
Daley, Robert P. On the error correcting power of pluralism in BC-type inductive inference. (English) Zbl 0582.68020 Theor. Comput. Sci. 24, 95-104 (1983). MSC: 68Q05 03D20 PDFBibTeX XMLCite \textit{R. P. Daley}, Theor. Comput. Sci. 24, 95--104 (1983; Zbl 0582.68020) Full Text: DOI
Uspenskij, V. A. [Alavina, R.] Post’s machine. Transl. from the Russian by R. Alavina. (English) Zbl 0578.68042 Little Mathematics Library. Moscow: Mir Publishers. 88 p. R. 0.36 (1983). MSC: 68Q05 68-01 68W99 03-01 03D10 PDFBibTeX XML
Borzov, Yu. V.; Urtans, G. B. Formulas for the processing of files. (Russian) Zbl 0574.68016 Latv. Mat. Ezheg. 27, 202-209 (1983). Reviewer: J.Just MSC: 68P05 68Q05 PDFBibTeX XMLCite \textit{Yu. V. Borzov} and \textit{G. B. Urtans}, Latv. Mat. Ezheg. 27, 202--209 (1983; Zbl 0574.68016)
Yukna, Stasis On the arithmetization of computations. (Russian. English summary) Zbl 0567.03015 Mat. Logika Primen. 3, 117-125 (1983). MSC: 03D15 03D10 PDFBibTeX XMLCite \textit{S. Yukna}, Mat. Logika Primen. 3, 117--125 (1983; Zbl 0567.03015)
Kramosil, Ivan Monte-Carlo methods from the point of view of algorithmic complexity. (English) Zbl 0551.68039 Information theory, statistical decision functions, random processes, Trans. 9th Prague Conf., Prague 1982, Vol. A, 39-51 (1983). MSC: 68Q25 65C05 PDFBibTeX XML
Furst, Merrick; Lipton, Richard; Stockmeyer, Larry Pseudorandom number generation and space complexity. (English) Zbl 0549.68032 Foundations of computation theory, Proc. int. FCT-Conf., Borgholm/Swed. 1983, Lect. Notes Comput. Sci. 158, 171-176 (1983). MSC: 68Q25 65C10 68R10 05C70 PDFBibTeX XML
Paul, Wolfgang; Reischuk, Ruediger On alternation. II. A graph theoretic approach to determinism versus nondeterminism. (Russian) Zbl 0545.68040 Kibern. Sb., Nov. Ser. 20, 123-140 (1983). MSC: 68Q05 68Q25 68R10 03D10 03D15 PDFBibTeX XMLCite \textit{W. Paul} and \textit{R. Reischuk}, Kibern. Sb., Nov. Ser. 20, 123--140 (1983; Zbl 0545.68040)
Grandjean, Etienne Complexity of the first-order theory of almost all finite structures. (English) Zbl 0542.03018 Inf. Control 57, 180-204 (1983). MSC: 03D15 03C13 03D10 PDFBibTeX XMLCite \textit{E. Grandjean}, Inf. Control 57, 180--204 (1983; Zbl 0542.03018) Full Text: DOI
Hodges, Andrew Alan Turing: The Enigma. (English) Zbl 0541.68001 New York: Simon and Schuster, Inc. XII, 587 p. $ 22.50 (1983). Reviewer: Albert A. Mullin (Madison) MSC: 68-03 03-03 01A70 68Q05 03D10 PDFBibTeX XML
Freivalds, Rusins Space and reversal complexity of probabilistic one-way Turing machines. (English) Zbl 0539.68040 Foundations of computation theory, Proc. int. FCT-Conf., Borgholm/Swed. 1983, Lect. Notes Comput. Sci. 158, 159-170 (1983). Reviewer: W.R.Nico MSC: 68Q05 68Q25 68Q45 PDFBibTeX XML
Inoue, Katsushi; Takanami, Itsuo; Taniguchi, Hiroshi Two-dimensional alternative Turing machines. (English) Zbl 0539.68039 Theor. Comput. Sci. 27, 61-83 (1983). Reviewer: M.Kratko MSC: 68Q05 68Q25 PDFBibTeX XMLCite \textit{K. Inoue} et al., Theor. Comput. Sci. 27, 61--83 (1983; Zbl 0539.68039) Full Text: DOI
Volger, Hugo Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories. (English) Zbl 0538.03035 Theor. Comput. Sci. 23, 333-337 (1983). Reviewer: J.M.Plotkin MSC: 03D10 03B25 PDFBibTeX XMLCite \textit{H. Volger}, Theor. Comput. Sci. 23, 333--337 (1983; Zbl 0538.03035) Full Text: DOI
Loui, Michael C. Optimal dynamic embedding of trees into arrays. (English) Zbl 0526.68016 SIAM J. Comput. 12, 463-472 (1983). MSC: 68P05 68Q05 PDFBibTeX XMLCite \textit{M. C. Loui}, SIAM J. Comput. 12, 463--472 (1983; Zbl 0526.68016) Full Text: DOI Link
Zak, Stanislav A Turing machine time hierarchy. (English) Zbl 0525.68026 Theor. Comput. Sci. 26, 327-333 (1983). MSC: 68Q25 68Q45 68Q05 PDFBibTeX XMLCite \textit{S. Zak}, Theor. Comput. Sci. 26, 327--333 (1983; Zbl 0525.68026) Full Text: DOI
Cremers, Armin B.; Hibbard, Thomas N. Applicative state transition systems in LISP-like notation. (English) Zbl 0523.68038 GI - 13.Jahrestag., Proc., Hamburg 1983, Inf.-Fachber. 73, 51-66 (1983). MSC: 68Q05 68N99 PDFBibTeX XML
Mundici, Daniele Natural limitations of decision procedures for arithmetic with bounded quantifiers. (English) Zbl 0523.03028 Arch. Math. Logik Grundlagenforsch. 23, 37-54 (1983). MSC: 03D15 03B25 03D10 03F20 PDFBibTeX XMLCite \textit{D. Mundici}, Arch. Math. Logik Grundlagenforsch. 23, 37--54 (1983; Zbl 0523.03028) Full Text: DOI EuDML
Vitanyi, Paul M. B. On the simulation of many storage heads by a single one. (Extended abstract). (English) Zbl 0521.68045 Automata, languages and programming, 10th Colloq., Barcelona/Spain 1983, Lect. Notes Comput. Sci. 154, 687-694 (1983). MSC: 68Q05 PDFBibTeX XML
Stillwell, John C. Efficient computation in groups and simplicial complexes. (English) Zbl 0519.20031 Trans. Am. Math. Soc. 276, 715-727 (1983). MSC: 20F10 68Q25 68Q05 20-04 57M20 PDFBibTeX XMLCite \textit{J. C. Stillwell}, Trans. Am. Math. Soc. 276, 715--727 (1983; Zbl 0519.20031) Full Text: DOI
Chlebus, Bogdan S. On four logics of programs and complexity of their satisfiability problems: extended abstract. (English) Zbl 0513.68023 Logics of programs and their applications, Proc. Symp., Poznan 1980, Lect. Notes Comput. Sci. 148, 98-107 (1983). MSC: 68Q65 68N01 03B60 03B45 03D15 PDFBibTeX XML
Ibarra, Oscar H.; Moran, Shlomo Some time-space tradeoff results concerning single-tape and offline TM’s. (English) Zbl 0512.68036 SIAM J. Comput. 12, 388-394 (1983). MSC: 68Q05 PDFBibTeX XMLCite \textit{O. H. Ibarra} and \textit{S. Moran}, SIAM J. Comput. 12, 388--394 (1983; Zbl 0512.68036) Full Text: DOI
Watanabe, Osamu The time-precision tradeoff problem on on-line probabilistic Turing machines. (English) Zbl 0509.68045 Theor. Comput. Sci. 24, 105-117 (1983). MSC: 68Q05 68W99 68Q25 PDFBibTeX XMLCite \textit{O. Watanabe}, Theor. Comput. Sci. 24, 105--117 (1983; Zbl 0509.68045) Full Text: DOI
Nakamura, Akira; Ono, Hiroakira Pictures of functions and their acceptability by automata. (English) Zbl 0504.68027 Theor. Comput. Sci. 23, 37-48 (1983). MSC: 03D60 68Q05 PDFBibTeX XMLCite \textit{A. Nakamura} and \textit{H. Ono}, Theor. Comput. Sci. 23, 37--48 (1983; Zbl 0504.68027) Full Text: DOI