Pitt, L. (2023). Turing Tumble is Turing-Complete. Theoretical computer science, 948, 113734. https://doi.org/10.1016/j.tcs.2023.113734
Citácia podle Chicago (17th ed.)Pitt, Lenny. "Turing Tumble Is Turing-Complete." Theoretical Computer Science 948 (2023): 113734. https://doi.org/10.1016/j.tcs.2023.113734.
Citácia podľa MLA (8th ed.)Pitt, Lenny. "Turing Tumble Is Turing-Complete." Theoretical Computer Science, vol. 948, 2023, p. 113734, https://doi.org/10.1016/j.tcs.2023.113734.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..