By Michael R. dos Santos

Referências:

Adleman, L.M. (1994). Molecular computation of solutions to combinatorial problems. Science, 266 5187, 1021-4 .

Turing, Alan Mathison. "On computable numbers, with an application to the Entscheidungsproblem." J. of Math 58.345-363 (1936): 5.

Gödel, K., 1931, “Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I,” Monatshefte für Mathematik Physik, 38: 173–198. English translation in van Heijenoort 1967, 596–616, and in Gödel 1986, 144–195.

Dias, N., & Stein, C. A. (2002). Antisense oligonucleotides: basic concepts and mechanisms. Molecular cancer therapeutics, 1(5), 347-355.

Organick, L., Ang, S. D., Chen, Y. J., Lopez, R., Yekhanin, S., Makarychev, K., ... & Strauss, K. (2018). Random access in large-scale DNA data storage. Nature biotechnology, 36(3), 242-248.

Ogihara, M., & Ray, A. (2000). DNA computing on a chip. Nature, 403(6766), 143-144.

Erlich, Y., & Zielinski, D. (2017). DNA Fountain enables a robust and efficient storage architecture. science, 355(6328), 950-954.

Church, G. M., Gao, Y., & Kosuri, S. (2012). Next-generation digital information storage in DNA. Science, 337(6102), 1628-1628.

Ileri, A. M., Ozercan, H. I., Gundogdu, A., Senol, A. K., Ozkaya, M. Y., & Alkan, C. (2016). Coinami: a cryptocurrency with DNA sequence alignment as proof-of-work. arXiv preprint arXiv:1602.03031.

Referências:

Paper princiapal que fundou o tema: Wiesner, Stephen. “Conjugate coding.” SIGACT News 15 (1983): 78-88.

Sobre Física quântica

M. Planck, Verhandl. Dtsch. phys. Ges., 2, 237. 1900. On the Theory of the Energy Distribution Law of the Normal. Spectrum. M. Planck. Berlin.

Einstein, Albert (1905). "Über einen die Erzeugung und Verwandlung des Lichtes betreffenden heuristischen Gesichtspunkt" [On a Heuristic Point of View about the Creation and Conversion of Light] (PDF). Annalen der Physik (in German). 17 (6): 132–148.

Schrödinger, The Present Status of Quantum Mechanics, Die Naturwissenschaften 1935. Volume 23, Issue 48.

Heisenberg, W. Über den anschaulichen Inhalt der quantentheoretischen Kinematik und Mechanik. Z. Physik 43, 172–198 (1927). https://doi.org/10.1007/BF01397280.

Bloch, Felix (Oct 1946). "Nuclear induction". Phys. Rev. 70 (7–8): 460–474.

Einstein, Albert B. et al. “Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?” Physical Review 47 (1935): 777-780.

Bohr, N. (1935-10-13). "Can Quantum-Mechanical Description of Physical Reality be Considered Complete?" (PDF). Physical Review. 48 (8): 696–702.

Bell, John S. "On the einstein podolsky rosen paradox." Physics Physique Fizika 1.3 (1964): 195.

Primeiro protocolo de computação quântica:

C. H. Bennett and G. Brassard. "Quantum cryptography: Public key distribution and coin tossing". In Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, volume 175, page 8. New York, 1984.

Quantum Teleportation:

Bennett et al. “Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels.” Physical review letters 70 13 (1993): 1895-1899.

Teorema da não-clonagem:

Park, James L.. “The concept of transition in quantum mechanics.” Foundations of Physics 1 (1970): 23-33.

Wootters, William; Zurek, Wojciech (1982). "A Single Quantum Cannot be Cloned". Nature. 299 (5886): 802–803.

Dieks, Dennis (1982). "Communication by EPR devices". Physics Letters A. 92 (6): 271–272.

Quantum Money:

Farhi, Edward, et al. "Quantum money from knots." Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. 2012.

Aaronson, Scott. "Quantum copy-protection and quantum money." 2009 24th Annual IEEE Conference on Computational Complexity. IEEE, 2009.

Aaronson, Scott. “The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes.” Electron. Colloquium Comput. Complex. TR16 (2016): n. pag.

Quantum Internet:

Lloyd, Seth, et al. "Infrastructure for the quantum Internet." ACM SIGCOMM Computer Communication Review 34.5 (2004): 9-20.

Wehner, Stephanie, David Elkouss, and Ronald Hanson. "Quantum internet: A vision for the road ahead." Science 362.6412 (2018): eaam9288.

Quantum RAM:

Specht, Holger P., et al. "A single-atom quantum memory." Nature 473.7346 (2011): 190-193.

Giovannetti, Vittorio, Seth Lloyd, and Lorenzo Maccone. "Quantum random access memory." Physical review letters 100.16 (2008): 160501.

Não couberam todas aqui, usaremos elas em outros episódios.

Eu acredito que a Hipótese da Simulação de Nick Bostrom seja uma psedociência que não deve ser considerada. Mas ainda sim deve ser analisada e refutada de forma coerente e clara, e é isso que falamos aqui, sobre o universo como um sistema matemático, computacional e simulável, mas ainda sim, não estamos em uma Matrix.

Referências:

1. Baudrillard, Jean. “Jean Baudrillard, Simulacra and Simulations.” (2002).

2. Bostrom, Nick. "Are we living in a computer simulation?." The philosophical quarterly 53.211 (2003): 243-255.

3. Bostrom, Nick. "The simulation argument: Why the probability that you are living in a matrix is quite high." Times Higher Education Supplement (2003).

APA.

4. Deleuze, Gilles, and Rosalind Krauss. “Plato and the Simulacrum.” October, vol. 27, 1983, pp. 45–56. JSTOR, https://doi.org/10.2307/778495. Accessed 30 Sep. 2022.

5. Chalmers, David J. "The Matrix as metaphysics." Science Fiction and Philosophy: From Time Travel to Superintelligence (2016): 35-54.

APA.

6. Tegmark, Max. "The mathematical universe." Foundations of physics 38.2 (2008): 101-150.

7. Lloyd, Seth. “Computational capacity of the universe.” Physical review letters 88 23 (2002): 237901 .

8. Lavaux, Guilhem. “Precision constrained simulation of the local Universe.” Monthly Notices of the Royal Astronomical Society 406 (2009): 1007-1013.

9. Habib, Salman et al. “The Universe at extreme scale: Multi-petaflop sky simulation on the BG/Q.” 2012 International Conference for High Performance Computing, Networking, Storage and Analysis (2012): 1-11.

10. Beane, Silas R., Zohreh Davoudi, and Martin J Savage. "Constraints on the Universe as a Numerical Simulation." The European Physical Journal A 50.9 (2014): 1-9.

Citações de Galileu e Newton:

11. Opere Il Saggiatore p. 171.

12. On the margin of his own copy of Dialogue on the Great World Systems.Quoted in J R Newman, The World of Mathematics (New York 1956).

13. Principia Mathematica.

Referências:

1. Pihlgren, Gustav et al. “Realistic NPCs in Video Games Using Different AI Approaches.” (2016).

2. Safaria et. al, Design ond Implementation of Zoopedia: Behaviour of Non Playable Character (NPC) of Tiger Hunting the Prey, Procedia - Social and Behavioral Sciences 67 ( 2012 ) 196 – 202, ELSEVIER.

3. Sestini, Alessandro et al. “Deep Policy Networks for NPC Behaviors that Adapt to Changing Design Parameters in Roguelike Games.” ArXiv abs/2012.03532 (2020): n. pag.

4. Suarez, J., Du, Y., Mordatch, I., & Isola, P. (2020). Neural MMO v1.3: A Massively Multiagent Game Environment for Training and Evaluating Neural Networks. ArXiv, abs/2001.12004.

5. Reed et, al. A Generalist Agent, Deep Mind (2022), arXiv:2205.06175.

6. Piloto, L.S., Weinstein, A., Battaglia, P. et al. Intuitive physics learning in a deep-learning model inspired by developmental psychology. Nat Hum Behav 6, 1257–1267 (2022). https://doi.org/10.1038/s41562-022-01394-8.

7. Santos, Inteligência Artificial nos Games, Aranea Science, 2022.

8. Retes e Carvalho, Development of an intelligent agent for Tibia MMORPG, Academic Journal on Computing, Enginnering and Applied Mathematics, VOL. 2, NO. 2, August 2021.

Os Artigos estão disponível no Turing Archive: https://turingarchive.kings.cam.ac.uk

Referências:

AMT/B/7,'Digital computers applied to games'. n.d. AMT's contribution to 'Faster than thought', ed. B.V. Bowden, London 1953. Published by Pitman Publishing. TS with MS corrections. R.S. 1953b.

AMT/C/18AMS, 'The game of poker'. Unfinished draft (pp. 1-13 only numbered), with extensive notes and calculations, many on reverse of mathematical exercises by other individuals. n.d.

AMT/C/22AMS, 'The rules of GO' (a game for 2 players with counters). Written on King's College, Cambridge, writing paper. n.d.

A. M. TURING, I. COMPUTING MACHINERY AND INTELLIGENCE, Mind, Volume LIX, Issue 236, October 1950, Pages 433–460, https://doi.org/10.1093/mind/LIX.236.433.

Campbell, M., Hoane, A.J., & Hsu, F. (2002). Deep Blue. Artif. Intell., 134, 57–83.

Silver, D., Huang, A., Maddison, C. et al. Mastering the game of Go with deep neural networks and tree search. Nature 529, 484–489 (2016). https://doi.org/10.1038/nature16961.

Silver, David et al. “Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm.” ArXiv abs/1712.01815 (2017): n. pag.

Referências:

N. Bourbaki, Architektura matematiky, Pokroky matematiky, fyziky a astronomie, Vol. 5 (1960), No. 5, 509--518.

Referências:

Campbell, M., Hoane, A.J., & Hsu, F. (2002). Deep Blue. Artif. Intell., 134, 57–83.

Hsu, F. (1999). IBM’s Deep Blue Chess grandmaster chips. IEEE Micro, 19, 70–81.

Silver et, al. , Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm, arXiv:1712.01815, 2017.

AMT/B/7,'Digital computers applied to games'. n.d. AMT's contribution to 'Faster than thought', ed. B.V. Bowden, London 1953. Published by Pitman Publishing. TS with MS corrections. R.S. 1953b

Ainda que eu disse que acredito na anedota, confesso que foi mais uma opinião pessoal minha,  então talvez analisar se nas obras de Euler ela é mencionada, resolveria o problema ou outra fonte histórica.

Referências:

Thiébault, Mes Souvenirs de vingt ans de séjour à Berlin, pg. 141, Vol. 3,  1804.

Dirk J. Struik, from his book A Concise History of Mathematics, Third Revised Edition, Dover, 1967, p. 129.

Karp e Gert Schubring, Handbook on the History of Mathematics Education, Springer 2014.

Gillings, Richard J. "The so-called Euler-Diderot incident." The American Mathematical Monthly 61.2 (1954): 77-80.