A SIMPLER APPROACH TO THE BUSY BEAVER PROBLEM

Let TM(k,l) be the set of one-tape Turing machines with k states and l symbols. It is known that the halting problem is decidable for machines in TM(2,3) and TM(3,2). We prove that the decidability of machines in TM(2,4) and TM(3,3) will be difficult to ...

<P>To analyze networks of queues, it is important to be able to analyze departure processes from single queues. For the M/M/s and M/G/∞ models, the stationary departure process is simple Poisson, but in general the stationary departure process is quite ...

We show that, on inputs of length exceeding 5n2, any n-state unary two-way nondeterministic finite automaton (2nfa) can be simulated by a (2n+2)-state quasi-sweeping 2nfa. Such a result, besides providing a “normal form” for 2nfa's, enables us to get a ...