Computing Fibonacci numbers on a Turing Machine

2006/01/13 by A. B. Vinokur, Vinokur, Alex
Computer Science · Physics and Astronomy · #Advanced Mathematical Theories and Applications #Computability, Logic, AI Algorithms #Discrete Mathematics (cs.DM) #F.1.1 #FOS: Computer and information sciences #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.cs/0601050

openalex publication_date 2006/01/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A Turing machine that computes Fibonacci numbers is described.

Related

• Twelve Simple Algorithms to Compute Fibonacci Numbers
• Fibonacci and digit-by-digit computation; An example of reverse engineering in computational mathematics
• Fibonacci’s Computation Methods vs Modern Algorithms
• Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci
• A note on closed-form representation of Fibonacci numbers using Fibonacci trees