Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

Computing Fibonacci Numbers on a Turing Machine

_____________________________________
Library Home || Full Table of Contents || Suggest a Link || Library Help
_____________________________________

Visit this site: http://semillon.wpi.edu/~aofa/AofA/msg00012.html
Author:Alex Vinokur
Description: 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.
Levels: College
Languages: English
Resource Types: Topic Tools Miscellaneous
Math Topics: Algorithms, Formal Languages and Automata

[Privacy Policy] [Terms of Use]

_____________________________________
Home || The Math Library || Quick Reference || Search || Help
_____________________________________

© 1994-2013 Drexel University. All rights reserved.
http://mathforum.org/
 The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.The Math Forum is a research and educational enterprise of the Drexel University School of Education.