Alonzo Church suggested to the writer that a certain problem of Thue  might be proved unsolvable by the methods of . We proceed to prove the problem recursively unsolvable, that is, unsolvable in the sense of Church , but by a method meeting the special needs of the problem.
Thue's (general) problem is the following. Given a finite set of symbols α1, α2, …, αμ, we consider arbitrary strings (Zeichenreihen) on those symbols, that is, rows of symbols each of which is in the given set. Null strings are included.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.