Computable permutations and word problems
From MaRDI portal
Publication:2314871
DOI10.4171/LEM/64-1/2-6OpenAlexW2946064327WikidataQ127832156 ScholiaQ127832156MaRDI QIDQ2314871
Publication date: 30 July 2019
Published in: L'Enseignement Mathématique. 2e Série (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4171/lem/64-1/2-6
Related Items (1)
Cites Work
- Unnamed Item
- Generic-case complexity, decision problems in group theory, and random walks.
- Turing Computability
- Constructive Analogues of the Group of Permutations of the Natural Numbers
- Über die Permutationsgruppe der natürlichen Zahlenfolge
- Relationships Between Reducibilities
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Recursive Predicates and Quantifiers
- Recursively enumerable sets of positive integers and their decision problems
This page was built for publication: Computable permutations and word problems