Computing Fibonacci Numbers on a Turing Machine
Library Home || Full Table of Contents || Suggest a Link || Library Help
|An algorithm that computes Fibonacci numbers on a Turing Machine. Transition table contains 100 rules. The program computes a Fibonacci number. A number 'n' is represented by n 1-s. Input: number 'n'. Output: Fibonacci#n.|
|Resource Types:||Topic Tools Miscellaneous|
|Math Topics:||Algorithms, Formal Languages and Automata|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.