Orbit decidability, applications and variations
Enric Ventura
TL;DR
This paper explores the concept of orbit decidability, extending its framework and examining its variations, highlighting recent theoretical advances and algebraic applications.
Contribution
It generalizes the notion of orbit decidability, discusses its variations, and connects recent theorems to algebraic applications.
Findings
Recent theorem revitalizes orbit decidability importance
Exploration of generalizations and variations of the problem
Applications in algebraic structures
Abstract
We present the notion of orbit decidability into a more general framework, exploring interesting generalizations and variations of this algorithmic problem. A recent theorem by Bogopolski-Martino-Ventura gave a renovated protagonism to this notion and motivated several interesting algebraic applications.
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
TopicsComputability, Logic, AI Algorithms · Digital Image Processing Techniques · Space Satellite Systems and Control