PublicaciĂłn: A BINARY COMPLETE AND APERIODIC TURING MACHINE
Fecha
2021
TĂtulo de la revista
ISSN de la revista
TĂtulo del volumen
Editor
International Journal of Unconventional Computing
Resumen
TURING MACHINES HAVE BEEN STUDIED AS DYNAMICAL SYSTEMS FOR MORE THAN TWO DECADES, FIRST FORMALIZED BY KURKA, PROPOSING A TOPOLOGICAL DYNAMICAL SYSTEM NAMED TURING MACHINE WITH MOVING TAPE (TMT). IT WAS CONJECTURED THAT EVERY TMT HAS AT LEAST ONE PERIODIC POINT. NOWADAYS, THERE ARE SEVERAL EXAMPLES OF APERIODIC TURING MACHINES, DISPROVING KURKA?S CONJECTURE. MOREOVER, ONE OF THESE MACHINES, NAMED SMART, HAS OTHER INTERESTING PROPERTIES LIKE REVERSIBILITY, COMPLETENESS, APERIODICITY, TOPOLOGICAL MINIMALITY, AMONG OTHERS. THIS MACHINE HAS FOUR STATES AND WORKS OVER AN ALPHABET OF THREE SYMBOLS. IN THIS RESEARCH, WE STUDY THE DYNAMICAL PROPERTIES OF BINSMART, A 2-SYMBOLS RECONSTRUCTION OF THE MAIN DYNAMIC OF SMART MACHINE. THIS MACHINE RESULTS TO BE APERIODIC, TOPOLOGICALLY MINIMAL (THEREFORE TRANSITIVE) BUT NOT TIME-SYMMETRIC, AS IT IS NOT A DIRECT TRANSLATION OF THE ORIGINAL MACHINE. WE ALSO PROVE THAT ITS T-SHIFT IS A PRIMITIVE SUBSTITUTION.
