PublicaciĂłn: UNDECIDABILITY OF THE SPEED POSITIVENESS PROBLEM IN REVERSIBLE AND COMPLETE TURING MACHINES
Fecha
2021
Autores
TĂtulo de la revista
ISSN de la revista
TĂtulo del volumen
Editor
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
Resumen
IN 2014, JEANDEL PROVED THAT TWO DYNAMICAL PROPERTIES REGARDING TURING MACHINES CAN BE COMPUTABLE WITH ANY DESIRED ERROR , THE TURING MACHINE MAXIMUM SPEED AND TOPOLOGICAL ENTROPY. BOTH PROBLEMS WERE PROVED IN PARALLEL, USING EQUIVALENT PROPERTIES. THOSE RESULTS WERE UNEXPECTED, AS MOST (IF NOT ALL) DYNAMICAL PROPERTIES ARE UNDECIDABLE. NEVERTHELESS, TOPOLOGICAL ENTROPY POSITIVENESS FOR REVERSIBLE AND COMPLETE TURING MACHINES WAS SHORTLY PROVED TO BE UNDECIDABLE, WITH A REDUCTION OF THE HALTING PROBLEM WITH EMPTY COUNTERS IN 2-REVERSIBLE COUNTER MACHINES. UNFORTUNATELY, THE SAME PROOF COULD NOT BE USED TO PROVE UNDECIDABILITY OF SPEED POSITIVENESS. IN THIS RESEARCH, WE PROVE THE UNDECIDABILITY OF HOMOGENEOUS TAPE REACHABILITY PROBLEM FOR APERIODIC AND REVERSIBLE TURING MACHINES, IN ORDER TO USE IT TO PROVE THE UNDECIDABILITY OF THE SPEED POSITIVENESS PROBLEM FOR COMPLETE AND REVERSIBLE TURING MACHINES.
