40
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      Recursive Unsolvability of a problem of Thue

      The Journal of Symbolic Logic
      JSTOR

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Alonzo Church suggested to the writer that a certain problem of Thue [6] might be proved unsolvable by the methods of [5]. We proceed to prove the problem recursively unsolvable, that is, unsolvable in the sense of Church [1], but by a method meeting the special needs of the problem.

          Related collections

          Most cited references4

          • Record: found
          • Abstract: not found
          • Article: not found

          An Unsolvable Problem of Elementary Number Theory

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Formal Reductions of the General Combinatorial Decision Problem

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              A variant of a recursively unsolvable problem

                Bookmark

                Author and article information

                Journal
                applab
                The Journal of Symbolic Logic
                J. symb. log.
                JSTOR
                0022-4812
                1943-5886
                March 1947
                March 2014
                : 12
                : 01
                : 1-11
                Article
                10.2307/2267170
                7cce6437-41b7-41fb-a797-231a94f23f6b
                © 1947
                History

                Comments

                Comment on this article