CITATION STYLE
Petersen, H. (2006). Computable lower bounds for busy beaver turing machines. Studies in Computational Intelligence, 25, 305–319. https://doi.org/10.1007/978-3-540-33461-3_12
Mendeley helps you to discover research relevant for your work.