2022/08/17 by Carl-Fredrik Nyberg Brodda, Nyberg-Brodda, Carl-Fredrik · 2 citations
Computer Science · Mathematics · #Computability, Logic, AI Algorithms #FOS: Mathematics #Geometric and Algebraic Topology #Group Theory (math.GR) #History and Overview (math.HO) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2208.08560
openalex publication_date 2022/08/17 · openalex created_date 2022/08/20 · openalex updated_date 2026/07/28
This is an English translation of four remarkable articles, originally written in Russian, by Sergei Ivanovich Adian (1931--2020), supplemented by the translation of two closely related articles by Andrei Andreevich Markov Jr (1903--1979). All six articles concern algorithmic undecidability of various problems for groups and monoids. The articles by S. I. Adian give his proof of the famous "Adian-Rabin Theorem", which shows that there is no algorithm which takes as input a finite presentation of a group together with a "Markov" property P (e.g. being the trivial group, being infinite, etc.), and which outputs whether or not the presented group has property P. The articles by A. A. Markov (Jr) give the analogous result for monoids (a significantly easier result), and appeared several years before the group-theoretic analogue. A preface detailing the contents of the articles and some commentary is provided, including the somewhat difficult task of deciding which of Adian's four articles should be considered as containing "the" proof of the Adian-Rabin theorem.