External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Nondeterministic Finite Algorithmic Procedures as the Models of Abstract Computability

V. D. Soloviev. Nondeterministic Finite Algorithmic Procedures as the Models of Abstract Computability. In Lothar Budach, Rais Gatic Bakharajev, Oleg Borisovic Lipanov, editors, Fundamentals of Computation Theory, International Conference FCT 87, Kazan, USSR, June 22-26, 1987, Proceedings. Volume 278 of Lecture Notes in Computer Science, pages 409-411, Springer, 1987.

Abstract

Abstract is missing.

runs on