Introducing a Finite State Machine for processing Collatz Sequences
- The present work will introduce a Finite State Machine (FSM) that processes any Collatz Sequence; further, we will endeavor to investigate its behavior in relationship to transformations of a special infinite input. Moreover, we will prove that the machine’s word transformation is equivalent to the standard Collatz number transformation and subsequently discuss the possibilities for use of this approach at solving similar problems. The benefit of this approach is that the investigation of the word transformation performed by the Finite State Machine is less complicated than the traditional number-theoretical transformation.
Author details: | Eldar SultanowORCiDGND, Denis Volkov, Sean Cox |
---|---|
URN: | urn:nbn:de:kobv:517-opus4-399223 |
Publication type: | Report |
Language: | English |
Date of first publication: | 2017/09/06 |
Publication year: | 2017 |
Publishing institution: | Universität Potsdam |
Release date: | 2017/09/06 |
Tag: | Collatz Conjecture; Double Colored Edges; Graph; State Machine |
Print run: | 1st version |
Organizational units: | Wirtschafts- und Sozialwissenschaftliche Fakultät / Wirtschaftswissenschaften |
DDC classification: | 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik |
MSC classification: | 11-XX NUMBER THEORY |
Collection(s): | Universität Potsdam / Sondersammlungen / Introducing a Finite State Machine for processing Collatz Sequences / First version |
License (German): | Keine öffentliche Lizenz: Unter Urheberrechtsschutz |
External remark: | Subsequent version of the paper |