On simulating Turing machines with matrix semigroups with integrality tests
From MaRDI portal
Publication:6562876
DOI10.1016/J.TCS.2024.114637MaRDI QIDQ6562876FDOQ6562876
Authors: Vesa Halava, Reino Niskanen 
Publication date: 27 June 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- A variant of a recursively unsolvable problem
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Title not available (Why is that?)
- Computer Aided Verification
- Unsolvability in 3 × 3 Matrices
- Title not available (Why is that?)
- Undecidability bounds for integer matrices using Claus instances
- Reachability problems in quaternion matrix and rotation semigroups
- MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM
- Termination of Integer Linear Programs
- Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words
- Title not available (Why is that?)
- On undecidability bounds for matrix decision problems
- How hard is it to verify flat affine counter systems with the finite monoid property?
- On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups
- Title not available (Why is that?)
- Title not available (Why is that?)
- What else is undecidable about loops?
- The identity problem in nilpotent groups of bounded class
This page was built for publication: On simulating Turing machines with matrix semigroups with integrality tests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562876)
