39922
2017
2017
eng
1st version
report
1
2017-09-06
2017-09-06
--
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.
urn:nbn:de:kobv:517-opus4-399223
online registration
<a href="http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-404738">Subsequent version of the paper</a>
Urheberrechtsschutz
Eldar Sultanow
Denis Volkov
Sean Cox
eng
uncontrolled
Collatz Conjecture
eng
uncontrolled
State Machine
eng
uncontrolled
Graph
eng
uncontrolled
Double Colored Edges
Mathematik
NUMBER THEORY
open_access
Wirtschaftswissenschaften
First version
Universität Potsdam
https://publishup.uni-potsdam.de/files/39922/preprint_sultanow-volkov-cox.pdf