Difference between revisions of "ICLM Journal Club"

From LMP Journal Club
Jump to: navigation, search
Line 6: Line 6:
  
 
<u>Abstract:</u>  Life is confronted with computation problems in a variety of domains including animal behavior, single-cell behavior, and embryonic development. Yet we currently do not know of a naturally existing biological system that is capable of universal computation, i.e., Turing-equivalent in scope. Finite-dimensional dynamical systems (which encompass most models of neural networks, intracellular signaling cascades, and gene regulatory networks) fall short of universal computation, but are assumed to be capable of explaining cognition and development. I present a class of models that bridge two concepts from distant fields: combinatory logic (or, equivalently, lambda calculus) and RNA molecular biology. A set of basic RNA editing rules can make it possible to compute any computable function with identical algorithmic complexity to that of Turing machines. The models do not assume extraordinarily complex molecular machinery or any processes that radically differ from what we already know to occur in cells. Distinct independent enzymes can mediate each of the rules and RNA molecules solve the problem of parenthesis matching through their secondary structure. The most plausible of these models does not strictly mimic the operation rules of combinatory logic or lambda calculus; it relies on standard RNA transcription from static genomic templates and the editing rules can be implemented with merely cleavage and ligation operations. This demonstrates that universal computation is well within the reach of molecular biology. It is therefore reasonable to assume that life has evolved – or possibly began with – a universal computer that yet remains to be discovered. The variety of seemingly unrelated computational problems across many scales can potentially be solved using the same RNA-based computation system. Experimental validation of this theory may immensely impact our understanding of memory, cognition, development, disease, evolution, and the early stages of life.
 
<u>Abstract:</u>  Life is confronted with computation problems in a variety of domains including animal behavior, single-cell behavior, and embryonic development. Yet we currently do not know of a naturally existing biological system that is capable of universal computation, i.e., Turing-equivalent in scope. Finite-dimensional dynamical systems (which encompass most models of neural networks, intracellular signaling cascades, and gene regulatory networks) fall short of universal computation, but are assumed to be capable of explaining cognition and development. I present a class of models that bridge two concepts from distant fields: combinatory logic (or, equivalently, lambda calculus) and RNA molecular biology. A set of basic RNA editing rules can make it possible to compute any computable function with identical algorithmic complexity to that of Turing machines. The models do not assume extraordinarily complex molecular machinery or any processes that radically differ from what we already know to occur in cells. Distinct independent enzymes can mediate each of the rules and RNA molecules solve the problem of parenthesis matching through their secondary structure. The most plausible of these models does not strictly mimic the operation rules of combinatory logic or lambda calculus; it relies on standard RNA transcription from static genomic templates and the editing rules can be implemented with merely cleavage and ligation operations. This demonstrates that universal computation is well within the reach of molecular biology. It is therefore reasonable to assume that life has evolved – or possibly began with – a universal computer that yet remains to be discovered. The variety of seemingly unrelated computational problems across many scales can potentially be solved using the same RNA-based computation system. Experimental validation of this theory may immensely impact our understanding of memory, cognition, development, disease, evolution, and the early stages of life.
 
  
 
<u>Relevant Paper(s):</u>    https://arxiv.org/abs/2008.08814
 
<u>Relevant Paper(s):</u>    https://arxiv.org/abs/2008.08814
 
  
 
='''About Us'''=
 
='''About Us'''=

Revision as of 14:52, 4 March 2021

This Week - 05 March 2021 (9:30 a.m., via Zoom)

Speaker: Hessameddin Akhlaghpour

Title: “Where is Life's Computer? An RNA-Based Theory of Natural Universal Computation ”

Abstract: Life is confronted with computation problems in a variety of domains including animal behavior, single-cell behavior, and embryonic development. Yet we currently do not know of a naturally existing biological system that is capable of universal computation, i.e., Turing-equivalent in scope. Finite-dimensional dynamical systems (which encompass most models of neural networks, intracellular signaling cascades, and gene regulatory networks) fall short of universal computation, but are assumed to be capable of explaining cognition and development. I present a class of models that bridge two concepts from distant fields: combinatory logic (or, equivalently, lambda calculus) and RNA molecular biology. A set of basic RNA editing rules can make it possible to compute any computable function with identical algorithmic complexity to that of Turing machines. The models do not assume extraordinarily complex molecular machinery or any processes that radically differ from what we already know to occur in cells. Distinct independent enzymes can mediate each of the rules and RNA molecules solve the problem of parenthesis matching through their secondary structure. The most plausible of these models does not strictly mimic the operation rules of combinatory logic or lambda calculus; it relies on standard RNA transcription from static genomic templates and the editing rules can be implemented with merely cleavage and ligation operations. This demonstrates that universal computation is well within the reach of molecular biology. It is therefore reasonable to assume that life has evolved – or possibly began with – a universal computer that yet remains to be discovered. The variety of seemingly unrelated computational problems across many scales can potentially be solved using the same RNA-based computation system. Experimental validation of this theory may immensely impact our understanding of memory, cognition, development, disease, evolution, and the early stages of life.

Relevant Paper(s): https://arxiv.org/abs/2008.08814

About Us

Introduction

The Integrative Center for Learning and Memory (ICLM) is a multidisciplinary center of UCLA labs devoted to understanding the neural basis of learning and memory and its disorders. This will require a unified approach across different levels of analysis, including;

1. Elucidating the molecular cellular and systems mechanisms that allow neurons and synapses to undergo the long-term changes that ultimately correspond to 'neural memories'.

2. Understanding how functional dynamics and computations emerge from complex circuits of neurons, and how plasticity governs these processes.

3. Describing the neural systems in which different forms of learning and memory take place, and how these systems interact to ultimately generate behavior and cognition.

History of ICLM

The Integrative Center for Learning and Memory formally LMP started in its current form in 1998, and has served as a platform for many interactions and collaborations within UCLA. A key event organized by the group is the weekly ICLM Journal Club. For more than 10 years, graduate students, postdocs, principal investigators, and invited speakers have presented on topics ranging from the molecular mechanisms of synaptic plasticity, through computational models of learning, to behavior and cognition. Dean Buonomano oversees the ICLM journal club with help of student/post doctoral organizers. For other events organized by ICLM go to http://www.iclm.ucla.edu/Events.html.

Current Organizers:

Megha Sehgal (Silva Lab) & Giselle Fernandes (Silva Lab)

Current Faculty Advisor:

Dean Buonomano


Past Organizers:

i) Anna Matynia(Aug 2004 - Jun 2008) (Silva Lab)

ii) Robert Brown (Aug 2008 - Jun 2009) (Balleine Lab)

iii) Balaji Jayaprakash (Aug 2008 - Nov 2011) (Silva Lab)

iv) Justin Shobe & Thomas Rogerson (Dec 2011 - June 2013) (Silva Lab)

v) Walt Babiec (O'Dell Lab) (2013-2014)

vi) Walt Babiec (O'Dell Lab) & Helen Motanis (Buonomano Lab) (2014-2017)

vii) Helen Motanis (Buonomano Lab) & Shonali Dhingra (Mehta Lab) (2017-2018)

viii) Shonali Dhingra (Mehta Lab) (2018-2020)

Wiki Newbies

Consult the User's Guide for information on using the wiki software.