#### Filter Results:

#### Publication Year

2004

2006

#### Publication Type

#### Key Phrase

#### Publication Venue

Learn More

A non-decreasing sequence of positive integer weights P = {p1,. .. , p2, pn} is called k-ordered if an intermediate sequence of weights produced by Huffman algorithm for initial sequence P on i-th step satisfies the following conditions: p

A Turing machine that computes Fibonacci numbers is described .

A non-decreasing sequence of positive integer weights P ={p 1 , p 2 ,…, p n } (n = N*(m-1) + 1, N is number of non-leaves of m-ary tree) is called absolutely ordered if the intermediate sequences of weights produced by m-ary Huffman algorithm for initial sequence P on i-th step satisfy the following conditions 2 , ,) (1) (− = < + N 0 i p p i m i m. Let T be… (More)

A Turing machine with faults, failures and recovery (TMF) is described. TMF is (weakly) non-deterministic Turing machine consisting of five semi-infinite Repair Phase). C++ Simulator of a Turing machine with faults, failures and recovery has been developed. In contrast to practical situation a regular Turing Machine never fails [1]. Some Turing machine that… (More)

- ‹
- 1
- ›