Drexel dragonThe Math Forum

The Math Forum Internet Mathematics Library

Computing Fibonacci Numbers on a Turing Machine

Library Home || Full Table of Contents || 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- The Math Forum at NCTM. All rights reserved.