Minsky machines and algorithmic problems
Mark Sapir
TL;DR
This paper surveys how Minsky machines are utilized to analyze algorithmic problems across various algebraic structures such as semigroups and groups.
Contribution
It provides a comprehensive overview of the application of Minsky machines in solving algorithmic problems in algebraic systems.
Findings
Minsky machines help classify the complexity of algebraic decision problems.
They reveal undecidability in certain algebraic structures.
The survey highlights key open problems in the field.
Abstract
This is a survey of using Minsky machines to study algorithmic problems in semigroups, groups and other algebraic systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Geometric and Algebraic Topology · Computability, Logic, AI Algorithms