Computational complexity of probabilistic Turing machines
暂无分享,去创建一个
[1] Hartley Rogers,et al. Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.
[2] F. C. Hennie,et al. One-Tape, Off-Line Turing Machine Computations , 1965, Inf. Control..
[3] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.
[4] Walter J. Savitch. Deterministic simulation of non-deterministic turing machines (Detailed Abstract) , 1969, STOC '69.
[5] Claude E. Shannon,et al. Computability by Probabilistic Machines , 1970 .
[6] Theodore P. Baker. Computational complexity and nondeterminism in flowchart programs. , 1974 .