Advertisement

Frequency algorithms and computations

  • B. A. Trakhtenbrot
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barzdin', J.M., On the frequency solution of algorithmically unsolvable mass problems, Dokl. Akad. Nauk SSSR, v. 191 (1970), No 5, 967–970.Google Scholar
  2. 2.
    Barzdin', J.M., Complexity and exactness of solving of initial segments of membership problem for recursively enumerable set, Dokl. Akad. Nauk SSSR, v. 199(1971), No 2, 262–264.Google Scholar
  3. 3.
    Freivald, R.V., On comparison of abilities of probabilistic and frequency algorithms, International symposium "Discrete systems", Riga, 1974.Google Scholar
  4. 4.
    Freivald, R.V., Speed computations by probabilistic machine, In Theory of Algorithms and Programs, II (J.M. Barzdin', ed.), Latvian State University, Riga, 1975, 201–205.Google Scholar
  5. 5.
    Ivshin, V.Ju., Complexity of the frequency computations of recursive predicates, In Third All-Union Conference on Math. Logic, Novosibirsk, 1974, 86–88.Google Scholar
  6. 6.
    Kinber, E.B., Frequency computations of the total recursive predicates and frequency enumeration of sets, Dokl. Akad. Nauk SSSR, v. 205(1972), No 1, 23–25.Google Scholar
  7. 7.
    Kinber E.B., On the frequency computations over infinite sequences, In Theory of Algorithms and Programs, 1(J.M. Barzdin', Ed.), Latvian State University, Riga, 1974, 48–67.Google Scholar
  8. 8.
    Kinber, E.B., On the frequency computations in real time, In Theory of Algorithms and Programs, II, (J.M. Barzdin', Ed.), Latvian State University, Riga, 1975, 174–182.Google Scholar
  9. 9.
    De Leeuw, K., Moore, E., Shannon, C., Shapiro, N., Computability by probabilistic machine, Automata studies, Princeton University Press, 1956, 183–212.Google Scholar
  10. 10.
    McNaughton, R., The theory of automata, a survey, Adv. in Comput., 1961, v. 2, Acad. Press, N.-Y.-London, 379–241.Google Scholar
  11. 11.
    Rabin, M., Theoretical impediments to artificial intelligence, IFIP — 1974, 615–619.Google Scholar
  12. 12.
    Rosenkrantz, D., Stearns, R., Lewis, P., Approximate algorithms for the travelling salesperson problem, 15th Annual Switching and Automata Theory, 1974, 33–42.Google Scholar
  13. 13.
    Rose, G., Ullian, J., Approximation of functions of the integers, pacific J. Math., 13(1963), No 2.Google Scholar
  14. 14.
    Sahni, S., Gonzales, T., P-complete approximation problems, J. of ACM, 23(1976), No 3, 555–565.CrossRefGoogle Scholar
  15. 15.
    Trakhtenbrot, B.A., On the frequency computation of functions, Algebra and logic, 2(1963), No 1.Google Scholar
  16. 16.
    Trakhtenbrot, B.A., Frequency computations, Trudy mat. Inst. Steklov, v. 113(1973), 221–232.Google Scholar
  17. 17.
    Trakhtenbrot, B.A., Barzdin', J.M., Finite automata(behaviour and synthesis), North-Holland, 1973.Google Scholar
  18. 18.
    Trakhtenbrot, B.A., Complexity of algorithms and computations, Novosibirsk State University, Novosibirsk, 1967.Google Scholar
  19. 19.
    Trakhtenbrot, B.A., Notes on the complexity of the probabilistic machine computations, In Theory of Algorithms and Mathematical Logic, Moscow, 1974, 159–176.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • B. A. Trakhtenbrot
    • 1
  1. 1.Institute of MathematicsSiberian Branch of the USSR Academy of SciencesNovosibirsk

Personalised recommendations