Real computational universality: the word problem for a class of groups with infinite presentation
From MaRDI portal
Publication:734136
DOI10.1007/s10208-009-9048-2zbMath1191.03031OpenAlexW2047947448MaRDI QIDQ734136
Publication date: 19 October 2009
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2007/877/
Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Computation over the reals, computable analysis (03D78)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Groups, the theory of ends, and context-free languages
- The combinatorial structure of the Hawaiian earring group
- Quantum automata and algebraic groups
- An explicit solution to Post's problem over the reals
- Ordered Rings Over Which Output Sets are Recursively Enumerable Sets
- THE WORD PROBLEM
- Computability and the algebra of fields: Some affine constructions
- The Arithmetical Hierarchy Over the Reals
- Accessible telephone directories
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- A model-theoretic proof for P ≠ NP over all infinite abelian group
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
- Embedding Theorems for Groups
- The P-DNP problem for infinite Abelian groups
This page was built for publication: Real computational universality: the word problem for a class of groups with infinite presentation