{"version":"1.0","type":"rich","provider_name":"Acast","provider_url":"https://acast.com","height":250,"width":700,"html":"<iframe src=\"https://embed.acast.com/$/650884ac30ce950011b5fba6/654af3fb84df860012116cc9?\" frameBorder=\"0\" width=\"700\" height=\"250\"></iframe>","title":"Part 2 of Hashim Al-Hashimi on Why We Should See Biological Molecules as Computing Machines ","description":"<p>Here is Part 2 of the conversation with Hashim Al-Hashimi, professor of biochemistry and molecular physics at Columbia University, who talks about his March 2023 paper in the Proceedings of the National Academy of Sciences (PNAS) entitled, “<a href=\"https://www.pnas.org/doi/abs/10.1073/pnas.2220022120\" rel=\"noopener noreferrer\" target=\"_blank\">Turing, von Neumann, and the computational architecture of biological machines,</a>” in which he writes about an opportunity for better understanding biological problems: seeing biological molecules as computing machines. &nbsp;</p><p><br></p><p>We discuss:</p><p><br></p><p>*Quick recap of Part 1 [1:05];</p><p>*DNA polymerase and its transition states (spoiler alert: it’s like Pac-Man) [1:57];</p><p>*The different shapes, or contortions, of biomolecules can be seen as computing transition states [5:52];</p><p>*Right now in biology, there is a lot of focus on protein structure, and too little focus on the protein’s program [7:25];</p><p>*Not all computers (and therefore biological molecules) are Turing machines — computer scientists have developed a hierarchy of computers [8:27];</p><p>*The simplest machine is the finite state machine, with no external memory, and so the states <em>are</em> a form of memory [8:37];</p><p>*Computation as anything that follows instructions to solve a problem [10:30];&nbsp;</p><p>*Push-down automaton as the next computer in the hierarchy [11:00];</p><p>*Bounded tape computer as the next  [13:00];</p><p>*How to begin building transition tables for biological molecules? Exploit the growing database of structures, to start. [14:00];</p><p>*Weakness of transition rules: they don’t include time information, critical to doing something like simulating a cell [16:00];&nbsp;</p><p>*Moving forward and building momentum around the effort to build transition tables [18:00];</p><p>*Quantum computing and its potential future role in determining transition states [19:50];&nbsp;</p><p>*Could we use this in the future to simulate complicated systems, like clinical trials, for example? [22:02];</p><p>*Relevance to a particular New York State high school science “disciplinary core idea” in the life sciences: “although DNA replication is tightly regulated and remarkably accurate, errors do occur and result in mutations, which are also a source of genetic variation,” [25:09] and how we can think about the ‘sweet spot’ of errors for evolving complexity but not harming an organism (or a computer!) [26:00];</p><p>*Hashim’s memory from high school science in Wales [32:35];</p><p>*Hashim’s advice to high school students today interested in studying science [34:30]</p><p><br></p>","author_name":"Susan Keatley"}