PublicaciĂłn: A BINARY COMPLETE AND APERIODIC TURING MACHINE
| dc.creator | PABLO ALFONSO CONCHA VEGA | |
| dc.creator | RODRIGO ARIEL TORRES AVILÉS | |
| dc.date | 2021 | |
| dc.date.accessioned | 2025-01-10T15:18:36Z | |
| dc.date.available | 2025-01-10T15:18:36Z | |
| dc.date.issued | 2021 | |
| dc.description.abstract | 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. | |
| dc.format | application/pdf | |
| dc.identifier.issn | 1548-7202 | |
| dc.identifier.issn | 1548-7199 | |
| dc.identifier.uri | https://repositorio.ubiobio.cl/handle/123456789/11404 | |
| dc.language | spa | |
| dc.publisher | International Journal of Unconventional Computing | |
| dc.rights | PUBLICADA | |
| dc.title | A BINARY COMPLETE AND APERIODIC TURING MACHINE | |
| dc.type | ARTĂŤCULO | |
| dspace.entity.type | Publication | |
| ubb.Estado | PUBLICADA | |
| ubb.Otra Reparticion | DEPARTAMENTO DE SISTEMAS DE INFORMACION | |
| ubb.Sede | CONCEPCIĂ“N |
