Author(s)

Louis M. Houston

Department of Innovation and Research, The University of Louisiana at Lafayette, Lafayette, LA, USA.

We prove that non-recursive base conversion can always be implemented by using a deterministic Markov process. Our paper discusses the pros and cons of recursive and non-recursive methods, in general. And we include a comparison between non-recursion and a deterministic Markov process, proving that the Markov process is twice as efficient.

Base Conversion, Recursion, Euclidean Division, Geometric Series, Markov Process

Houston, L. (2024) Non-Recursive Base Conversion Using a Deterministic Markov Process. Journal of Applied Mathematics and Physics, 12, 2112-2118. doi: 10.4236/jamp.2024.126129.