Computing Fibonacci numbers on a Turing Machine
Alex Vinokur
TL;DR
This paper presents a detailed construction of a Turing machine capable of computing Fibonacci numbers, illustrating the computational process for this classic sequence.
Contribution
It introduces a specific Turing machine design for Fibonacci computation, demonstrating the machine's operation and efficiency.
Findings
The Turing machine correctly computes Fibonacci numbers.
The machine's design showcases fundamental computational principles.
Efficiency analysis of the machine's operation.
Abstract
A Turing machine that computes Fibonacci numbers is described.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Mathematical Theories and Applications · semigroups and automata theory