Citace podle APA (7th ed.)

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

Citace 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.

Citace podle MLA (9th 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.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..