1. Adleman, L.M., DeMarrais, J., Huang, M.D.A.: Quantum computability. SIAM J. Comput. 26(5), 1524–1540 (1997)
2. Chandrasekharan, K.: Chebyshev’s theorem on the distribution of prime numbers. Springer, Heidelberg (1968). pp. 63–83
3. Dimitrijevs, M., Yakaryılmaz, A.: Uncountable classical and quantum complexity classes. In: Eigth Workshop on Non-Classical Models for Automata and Applications (NCMA2016), vol. 321, pp. 131–146. Austrian Computer Society (2016). books@ocg.at
4. Lecture Notes in Computer Science;R Freivalds,1983
5. Freivalds, R.: Space and reversal complexity of probabilistic one-way turing machines. Ann. Discrete Math. 24, 39–50 (1985)