EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 31 / No 2 (1997) RAIRO-Theor. Inf. Appl., 31 2 (1997) 159-204 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 31, Number 2, 1997
Page(s) 159 - 204
DOI https://doi.org/10.1051/ita/1997310201591
Published online 01 February 2017
  1. 1. M. MARGENSTERN, Sur la frontière entre machines de Turing à arrêt décidable et machines de Turing universelles. Rapport de recherche LITP N° 92.83, (Institut Blaise Pascal), 1992. [Google Scholar]
  2. 2. M. MARGENSTERN, Turing machines: on the frontier between a decidable halting problem and universality. Lecture Notes in Computer Science, 710, pp. 375-385, in Proceedings of FCT'93, 1993. [MR: 1260506] [Zbl: 0794.68047] [Google Scholar]
  3. 3. M. MARGENSTERN, Décidabilité du problème de l'arrêt pour les machines de Turing non-effaçante sur {0,1} et à deux instructions gauches. Rapport de recherche LITP N° 94.03 (Institut Blaise Pascal), 1994. [Google Scholar]
  4. 4. M. MARGENSTERN, Une machine de Turing universelle sur {0,1}, non-effaçante et à trois instructions gauches. Rapport de recherche LITP N° 94.08 (Institut Blaise Pascal), 1994. [Google Scholar]
  5. 5. M. MARGENSTERN, Une machine de Turing universelle non-effaçante à exactement trois instructions gauches. C.R.A.S., Paris, 1995, 320, I, pp. 101-106. [MR: 1320840] [Zbl: 0834.68024] [Google Scholar]
  6. 6. M. MARGENSTERN, Non-erasing Turing machines: a new frontier between a decidable halting problem and universality. Lecture Notes in Computer Science, 1995, 911, pp. 386-397, in Proceedings of LATIN'95). [MR: 1292457] [Google Scholar]
  7. 7. M. MARGENSTERN and L. PAVLOTSKAYA, Deux machines de Turing universelles à au plus deux instructions gauches. C.R.A.S., Paris, 1995, 320, I, pp. 1395-1400. [MR: 1338293] [Zbl: 0834.68025] [Google Scholar]
  8. 8. M. L. MINSKY, Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, N.J., 1967. [MR: 356580] [Zbl: 0195.02402] [Google Scholar]
  9. 9. L. PAVLOTSKAYA, Razreshimost' problemy ostanovki dlja nekotorykh klassov mashin T'juringa. Matematicheskie Zametki, Ijun' 1973, 13, (6), pp. 899-909, pp. 899-909. (transl. Solvability of the halting problem for certain classes of Turing machines, Notes of the Acad. Sci. USSR, Nov. 1973, 13, (6), pp. 537-541. [Zbl: 0284.02017] [Google Scholar]
  10. 10. L. PAVLOTSKAYA, Dostatochnye uslovija razreshimosti problemy ostanovki dlja mashin T'juring, Avtomaty i mashiny, 1978, pp. 91-118 (Sufficient conditions for halting problem decidability of Turing machines) (in Russian). [Zbl: 0426.68025] [Google Scholar]
  11. 11. Ju.V. ROGOZHIN, universal'nykh mashin T'juringa. Matematicheskie Issledovanija, 1982, 69 pp. 76-90, (Seven universal Turing machines) (in Russian). [MR: 711781] [Zbl: 0515.03020] [Google Scholar]
  12. 12. Ju.V. ROGOZHIN, Universal'naja mashina T'juringa s 10 sostojanijami i 3 simvolami. Matematicheskie Issledovanija, 1992, 69, pp. 76-90, (A universal Turing machine with 10 states and 3 symbols) (in Russian). [Zbl: 0515.03020] [Google Scholar]
  13. 13. Ju.V. ROGOZHIN, About Shannon's problem for Turing machines. Comput. Sci. J. Moldova, 1993 1 3(3), pp. 108-111. [Google Scholar]
  14. 14. Ju. V. ROGOZHIN, Small universal Turing machines, Theoretical Computer Science, 168-2, special issue on Universal Machines and Computations, 1996, pp. 215-240. [MR: 1422956] [Zbl: 0874.68106] [Google Scholar]
  15. 15. Ju. V. ROGOZHIN, A universal Turing machine with 21 states and 2 symbols, private communication, 1996. [Google Scholar]
  16. 16. C. E. SHANNON, A universal Turing machine with two internal states., Ann. of Math. Studies, 1956, 34, pp. 157-165. [MR: 79548] [Google Scholar]
  17. 17. A. M. TURING, On computable real numbers, with an application to the Entscheidungsproblem., Proc. Lond. Math. Soc., 1936, ser. 2, 42, pp. 230-265. [Zbl: 0016.09701] [Google Scholar]
  18. 18. H. A. WANG, variant to Turing's theory of Computing machines, J. Assoc. Comput. Mach., 1957, 4, 1, pp. 63-92. [Google Scholar]
  19. 19. G. P. ZYKIN, Zamechanie ob odnoj teoreme Khao Vana, Algebra i Logika, 1963, 2, 1, pp. 33-35, (Remark on a theorem of Hao Wang) (in Russian). [MR: 155748] [Zbl: 0171.27302] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.