News
A survey of the mathematical foundations of Computer Science. Finite automata and regular languages. Stack Acceptors and Context-Free Languages. Turing Machines, recursive and recursively enumerable ...
Marvin L. Minsky, Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines, Annals of Mathematics, Vol. 74, No. 3 (Nov., 1961), pp. 437-455 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback