Computing Fibonacci numbers on a Turing Machine
A Turing machine that computes Fibonacci numbers is described.
cs.DM↗
arXiv subjects
Alex Vinokur
Publications and source records attributed to Alex Vinokur.
Fibonacci connection between Huffman codes and Wythoff array
Fibonacci connection between non-decreasing sequences of positive integers producing maximum height Huffman trees and the Wythoff array has been proved.
cs.DM↗
Fibonacci-Like Polynomials Produced by m-ary Huffman Codes for Absolutely Ordered Sequences
Fibonacci-like polynomials produced by m-ary Huffman codes for absolutely ordered sequences have been described.
cs.DM↗
Turing Machine with Faults, Failures and Recovery
A Turing machine with faults, failures and recovery (TMF) is described. TMF is (weakly) non-deterministic Turing machine consisting of five semi-infinite tapes (Master Tape, Synchro Tape, Backup Tape, Backup Synchro Tape, User Tape) and four controlling components (Program, Daemon, Apparatus, User). Computational process consists of three phases (Program Phase, Failure Phase, Repair Phase). C++ Simulator of a Turing machine with faults, failures and recovery has been developed.
cs.LO↗