APA (7th ed.) Citation

Pitt, L. (2023). Turing Tumble is Turing-Complete. Theoretical computer science, 948, 113734. https://doi.org/10.1016/j.tcs.2023.113734

Chicago Style (17th ed.) Citation

Pitt, Lenny. "Turing Tumble Is Turing-Complete." Theoretical Computer Science 948 (2023): 113734. https://doi.org/10.1016/j.tcs.2023.113734.

MLA (9th ed.) Citation

Pitt, Lenny. "Turing Tumble Is Turing-Complete." Theoretical Computer Science, vol. 948, 2023, p. 113734, https://doi.org/10.1016/j.tcs.2023.113734.