Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Zametki:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Matematicheskie Zametki, 2002, Volume 71, Issue 5, Pages 732–741
DOI: https://doi.org/10.4213/mzm381
(Mi mzm381)
 

Turing Machines Connected to the Undecidability of the Halting Problem

L. M. Pavlotskaya
References:
Abstract: The problem of finding a Turing machine with undecidable halting problem whose program contains the smallest number of instructions is well known. Obviously, such a machine must satisfy the following condition: by deleting even a single instruction from its program, we get a machine with decidable halting problem. In this paper, Turing machines with undecidable halting problem satisfying this condition are called connected. We obtain a number of general properties of such machines and deduce their simplest corollaries concerning the minimal machine with undecidable halting problem.
Received: 06.12.2000
English version:
Mathematical Notes, 2002, Volume 71, Issue 5, Pages 667–675
DOI: https://doi.org/10.1023/A:1015840005656
Bibliographic databases:
UDC: 510.53+512.54.05
Language: Russian
Citation: L. M. Pavlotskaya, “Turing Machines Connected to the Undecidability of the Halting Problem”, Mat. Zametki, 71:5 (2002), 732–741; Math. Notes, 71:5 (2002), 667–675
Citation in format AMSBIB
\Bibitem{Pav02}
\by L.~M.~Pavlotskaya
\paper Turing Machines Connected to the Undecidability of the Halting Problem
\jour Mat. Zametki
\yr 2002
\vol 71
\issue 5
\pages 732--741
\mathnet{http://mi.mathnet.ru/mzm381}
\crossref{https://doi.org/10.4213/mzm381}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1936197}
\zmath{https://zbmath.org/?q=an:1029.03026}
\transl
\jour Math. Notes
\yr 2002
\vol 71
\issue 5
\pages 667--675
\crossref{https://doi.org/10.1023/A:1015840005656}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000176477200009}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-0141513942}
Linking options:
  • https://www.mathnet.ru/eng/mzm381
  • https://doi.org/10.4213/mzm381
  • https://www.mathnet.ru/eng/mzm/v71/i5/p732
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:1329
    Full-text PDF :175
    References:54
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024