DOCSLIB.ORG

IT 468 – Natural Computing

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
IT 468 – Natural Computing July 2020 IT 468 – Natural Computing Instructor Manish K Gupta (http://www.mankg.com) Room 2209 Faculty Block 2 mankg [at] daiict.ac.in Phone: +91-79-68261549 WhatsApp:+91-9898512703 Lab: http://www.guptalab.org Overview In last 60 years Information and Communication Technology (ICT) has had a great impact on our society. The most profound and accelerated impact of ICT can be seen in the last decade in the form of cell phones, connected computers and Internet. We even have a virtual currency. ICT is an interdisciplinary discipline combining IT (Information Technology) and CT (Communication Technology). IT has its root in computer science and CT has its root in theory of communication. Both the fields now can be seen as two sides of the same coin. Both deals with information, in IT we store (send information from now to then) and manipulate the information and in CT we send information from here to there (communicate). The mathematical principles of ICT lie in theoretical computer science (Turing machine) and information and coding theory (work of Shannon and Hamming). Realization of ICT is via logic gates and circuits in the area of Electronics and VLSI. If you look around the Nature around you many times you feel: What are the principles of Natural ICT? Can we use these principles to create Natural ICT engineering? We are fortunate enough that due to advancement of many fields we are now in a position to talk about Natural ICT. There are three main areas of Natural ICT: 1. ICT inspired by Nature 2. ICT by Natural objects 3. Nature as ICT (natural information processing) Natural ICT includes the following new and emerging areas: Mathematics of Natural Information Processing Natural Computing Natural Engineering (Synthetic Biology) Natural Algorithms Natural Communication Natural Signal Processing Naturotronics- Natural Logic Gates and Circuits Natural Programming Languages (Molecular Programming) © Manish K Gupta, 2010-2020 Visit us at http://www.guptalab.org Modified on July 20, 2020 Page 1 of 5 July 2020 Natural Networks (Nano-scale Networks, Complex Networks, Bi-Fi) Natural Storage (DNA data storage) Natural Logic Natural Robotics (Molecular) Natural Security and Cryptography Natural Coding and Information Theory Thus, Natural computing is a recent branch of computer science where we are learning from the nature on how to compute with natural living things such as DNA, protein, bacteria, etc. We want to solve complex problems with the help of DNA computer or bacterial computer or chemical computer. We want to store our data on such living things. So we require molecular/natural algorithms and natural error control. We can also divide principles of computing based on physics. On one side we have computing systems based on classical physics and on the other hand we have another emerging model of quantum computing based on quantum physics. Quantum computing and Bio-molecular computing are also considered as a part of natural computing. It turns out that nature itself is a computer, computing many things from billions of years. In 1994 a cryptographer Adleman did the first (breakthrough) engineering experiment by showing how to solve Hamiltonian path problem using DNA computer. Since then many more experiments have been done and many new natural computing models have been discovered. One of the potential applications of DNA computer is Doctor in a cell by 2050. In 2004, Shapiro demonstrated a DNA computer capable of diagnosing the cancer and releasing the drug. In July 2009, scientists have shown that a bacterial computer can also solve simple Hamiltonian path problem. In June 2011, Erik Winfree has built the largest DNA computer for finding square root. In July 2012, Martin Fussenegger’s group has built single cell mammalian biocomputers. Now we also have Monkey computing, Elephant computing and so on… This course is useful for computer science students and to anyone who want to learn about natural ICT. Tentative Course Content The course provides basic overview of natural ICT and it covers basic notation of biochemistry and molecular biology that are needed to learn about DNA computing. Basic models of computing such as finite automata (FA), push-down automata (PDA), linear bounded automata (LBA) and Turing machine (TM) with corresponding languages and their relationships, Quantum Turing machine (QTM) and quantum languages, computation by circuits, thermodynamics of computation, post systems, rewriting systems, L-systems, algorithmic botany, cellular automata, block cellular automata, Adleman experiment with DNA computer, different models of DNA computation (Lipton model, Sticker model, © Manish K Gupta, 2010-2020 Visit us at http://www.guptalab.org Modified on July 20, 2020 Page 2 of 5 July 2020 DNA splicing model, DNA self-assembly, hair pin model) and complexity problems such as integer factorization, basic arithmetic etc. Overview of algorithmic self-assembly (ASA), algorithms for natural security and cryptography, Experiments in self-assembly, DNA origami (2D and 3D), Error-correction in self-assembly, Applications, Bacterial computers and data storage, Peptide computing, Membrane computing, Chemical computing, Strand Displacement Systems. Some Open Problems, Popular Software Tools: Xgrow, XTile, CadNano, Sarse, Tiamat, programming language for designing and simulating DNA circuits, playing games with DNA computers (MAYA-I & II), Synthetic biology, Morphological (Liquid) Computing. Expected Outcome The students after completing the course will get a basic overview of the emerging area of Natural ICT and other natural computing models such as DNA computing, bacterial computing, Membrane computing and Chemical computing. They will get an insight on how to visualize various natural processes as a part of natural computing and they will learn the engineering aspects of natural computing. It exposes them the natural algorithms for solving various problems using natural objects such as DNA, protein, bacteria etc and they will learn about the various available tools such as Xgrow, Xtile, CadNano, Sarse, Tiamat. They will also learn about the natural error correction schemes. Projects in the course provide firsthand research opportunities in niche and hot area to the students. There are many universities offering Master degree in Natural computing. Textbook There is no specific textbook, but the following books will be helpful. We will provide many additional materials such as videos, handouts etc during the course. There is no need to purchase any book. 1. Martyn Amos, Theoretical and Experimental DNA Computation, 2005, Springer, ISBN 3-540-65773-8 2. Gheorge Paun, Grzegorz Rozenberg and Arto Salomaa, DNA Computing-New Computing Paradigms, 1998, Springer, ISBN 3-540-64196-3 3. Sudheer Sahu and John H. Reif, DNA based self-assembly and Nan robotics, 2008 4. Cris Calude and Gheorghe Paun, Computing with Cells and Atoms: An Introduction to Quantum, DNA and Membrane Computing, 2000, CRC 5. Zoya Ignatova, Israel Martinez-Perez and Karl-Heinz Zimmermann, DNA Computing Models, Springer, 2008 6. Ehrenfeucht, T. Harju, I. Petre, D.M. Prescott and G. Rozenberg, Computing in Living Cells: Gene Assembly in ciliates, 2004, Springer 7. The Oxford handbook of membrane computing Paun G., Rozenberg G., Salomaa A., Oxford University Press, Inc., New York, NY, 2010. 696 pp. © Manish K Gupta, 2010-2020 Visit us at http://www.guptalab.org Modified on July 20, 2020 Page 3 of 5 July 2020 8. Computing with cells: advances in membrane computing, Frisco P., Oxford University Press, Inc., New York, NY, 2009. 336 pp. 9. Biological Computation (Chapman & Hall/CRC Mathematical & Computational Biology) by Ehud Lamm and Ron Unger, 2011 10. Jian-Qin Liu and Katsunori Shimohara, Biomolecular Computation for Biotechnology, 2007, ISBN-10: 1-59693-014-4, Artech House 11. Rozenberg, Grzegorz; BÃock, Thomas; Kok, Joost N. (Eds.), Handbook of Natural Computation, Springer, 2010 12. Christopher Dwyer and Alvin Lebeck, Introduction to DNA Self-Assembled Computer Design, December 2007, Artech House Publishers 13. John A. Pelesko, Self-Assembly: The Science of Things That Put Themselves Together, May 21, 2007, CRC Press. 14. Natalio Krasnogor, Steve Gustafson, David A. Pelta and Jose L. Verdegay, SYSTEMS SELF-ASSEMBLY, Hardbound, 304 pages, publication date: MAR- 2008 ISBN-13: 978-0-444-52865-0 ISBN-10: 0-444-52865-2, ELSEVIER 15. Fundamentals of Natural Computing: Basic Concepts, Algorithms, and Applications (Chapman & Hall/CRC Computer & Information Science Series) [Hardcover] Leandro Nunes de Castro (Author) 16. Artificial Immune Systems: A New Computational Intelligence Approach [Paperback] Leandro Nunes de Castro (Author), Jonathan Timmis (Author) 17. Computation in Cells and Tissues: Perspectives and Tools of Thought R. Paton (Editor), Hamid Bolouri (Editor), W. Michael L. Holcombe (Editor), J. Howard Parish(Editor), Richard Tateson (Editor) 18. Self-organizing Software: From Natural to Artificial Adaptation Giovanna di Marzo Serugendo (Editor), Marie-Pierre Gleizes (Editor), Anthony Karageorgos (Editor) 19. Computability of the DNA and Cells: Splicing and Membrane Computing [Hardcover] Andrei Paun (Author) 20. Natural Computing in Computational Finance, Brabazon, Anthony; O'Neill, Michael; Maringer, Dietmar G. (Eds.) 1st Edition., 2010, 241 21. Prusinkiewicz, Przemyslaw and Aristid Lindenmayer, The Algorithmic Beauty of Plants, Springer 1990 22. Meinhardt, Hans; Przemyslaw Prusinkiewicz, Deborah R. Fowler, The Algorithmic Beauty of Sea Shells (3rd edition ed.), 2003 23. Mark Distribution (Tentative) / Grading Policy Assignments - 10% Mid Term -30% Scribe Notes-20% Project or Final Exam -40 % (one of them is optional) © Manish K Gupta, 2010-2020 Visit us at http://www.guptalab.org Modified on July 20, 2020 Page 4 of 5 July 2020 Project Policy Project has to be done in 3 parts. Part-1 (5%): Submission of 1 page abstract via LMS consisting of problem formulation. It is due in approximately 4 weeks after the start of the course. Part-2 (5%): Mid progress report (of 1 page) in another 4 weeks after part-1. Part-3 (30%): Final user manual and demo of the s/w towards the 18th week. Submission date of software to LMS will be announced later.
Load more

Recommended publications
  • DNA Computers for Work and Play
    INFORMATION SCIENCE COMPUTERS DNA FOR WORK AND PL AY TIC-TAC-TOE-PLAYING COMPUTER consisting of DNA strands in solution demonstrates the potential of molecular logic gates. © 2008 SCIENTIFIC AMERICAN, INC. Logic gates made of DNA could one day operate in your bloodstream, collectively making medical decisions and taking action. For now, they play a mean game of in vitro tic-tac-toe By Joanne Macdonald, Darko Stefanovic and Milan N. Stojanovic rom a modern chemist’s perspective, the mentary school in Belgrade, Serbia, we hap- structure of DNA in our genes is rather pened to be having dinner, and, encouraged by Fmundane. The molecule has a well-known some wine, we considered several topics, includ- importance for life, but chemists often see only ing bioinformatics and various existing ways of a uniform double helix with almost no function- using DNA to perform computations. We decid- al behavior on its own. It may come as a surprise, ed to develop a new method to employ molecules then, to learn that this molecule is the basis of a to compute and make decisions on their own. truly rich and strange research area that bridges We planned to borrow an approach from synthetic chemistry, enzymology, structural electrical engineering and create a set of molec- nanotechnology and computer science. ular modules, or primitives, that would perform Using this new science, we have constructed elementary computing operations. In electrical molecular versions of logic gates that can oper- engineering the computing primitives are called ate in water solution. Our goal in building these logic gates, with intuitive names such as AND, DNA-based computing modules is to develop OR and NOT.
    [Show full text]
  • Biological Computation
    Portland State University PDXScholar Computer Science Faculty Publications and Presentations Computer Science 9-21-2010 Biological Computation Melanie Mitchell Portland State University Follow this and additional works at: https://pdxscholar.library.pdx.edu/compsci_fac Part of the Biology Commons, and the Computer Engineering Commons Let us know how access to this document benefits ou.y Citation Details Mitchell, Melanie, "Biological Computation" (2010). Computer Science Faculty Publications and Presentations. 2. https://pdxscholar.library.pdx.edu/compsci_fac/2 This Working Paper is brought to you for free and open access. It has been accepted for inclusion in Computer Science Faculty Publications and Presentations by an authorized administrator of PDXScholar. Please contact us if we can make this document more accessible: [email protected]. Biological Computation Melanie Mitchell SFI WORKING PAPER: 2010-09-021 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at SFI, inspired by an invited visit to or collaboration at SFI, or funded by an SFI grant. ©NOTICE: This working paper is included by permission of the contributing author(s) as a means to ensure timely distribution of the scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the author(s). It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright.
    [Show full text]
  • Dynamics of Information As Natural Computation
    Information 2011, 2, 460-477; doi:10.3390/info2030460 OPEN ACCESS information ISSN 2078-2489 www.mdpi.com/journal/information Article Dynamics of Information as Natural Computation Gordana Dodig Crnkovic Mälardalen University, School of Innovation, Design and Engineering, Sweden; E-Mail: [email protected] Received: 30 May 2011; in revised form: 13 July 2011 / Accepted: 19 July 2011 / Published: 4 August 2011 Abstract: Processes considered rendering information dynamics have been studied, among others in: questions and answers, observations, communication, learning, belief revision, logical inference, game-theoretic interactions and computation. This article will put the computational approaches into a broader context of natural computation, where information dynamics is not only found in human communication and computational machinery but also in the entire nature. Information is understood as representing the world (reality as an informational web) for a cognizing agent, while information dynamics (information processing, computation) realizes physical laws through which all the changes of informational structures unfold. Computation as it appears in the natural world is more general than the human process of calculation modeled by the Turing machine. Natural computing is epitomized through the interactions of concurrent, in general asynchronous computational processes which are adequately represented by what Abramsky names “the second generation models of computation” [1] which we argue to be the most general representation of information dynamics. Keywords: philosophy of information; information semantics; information dynamics; natural computationalism; unified theories of information; info-computationalism 1. Introduction This paper has several aims. Firstly, it offers a computational interpretation of information dynamics of the info-computational universe [2,3].
    [Show full text]
  • Natural Computing Conclusion
    Introduction Natural Computing Conclusion Natural Computing Dr Giuditta Franco Department of Computer Science, University of Verona, Italy [email protected] For the logistics of the course, please see the syllabus Dr Giuditta Franco Slides Natural Computing 2017 Introduction Natural Computing Natural Computing Conclusion Natural Computing Natural (complex) systems work as (biological) information elaboration systems, by sophisticated mechanisms of goal-oriented control, coordination, organization. Computational analysis (mat modeling) of life is important as observing birds for designing flying objects. "Informatics studies information and computation in natural and artificial systems” (School of Informatics, Univ. of Edinburgh) Computational processes observed in and inspired by nature. Ex. self-assembly, AIS, DNA computing Ex. Internet of things, logics, programming, artificial automata are not natural computing. Dr Giuditta Franco Slides Natural Computing 2017 Introduction Natural Computing Natural Computing Conclusion Bioinformatics versus Infobiotics Applying statistics, performing tools, high technology, large databases, to analyze bio-logical/medical data, solve problems, formalize/frame natural phenomena. Ex. search algorithms to recover genomic/proteomic data, to process them, catalogue and make them publically accessible, to infer models to simulate their dynamics. Identifying informational mechanisms underlying living systems, how they assembled and work, how biological information may be defined, processed, decoded. New
    [Show full text]
  • A Computational Model Inspired by Gene Regulatory Networks
    Rui Miguel Lourenço Lopes A Computational Model Inspired by Gene Regulatory Networks Doctoral thesis submitted to the Doctoral Program in Information Science and Technology, supervised by Full Professor Doutor Ernesto Jorge Fernandes Costa, and presented to the Department of Informatics Engineering of the Faculty of Sciences and Technology of the University of Coimbra. January 2015 A Computational Model Inspired by Gene Regulatory Networks A thesis submitted to the University of Coimbra in partial fulfillment of the requirements for the Doctoral Program in Information Science and Technology by Rui Miguel Lourenço Lopes [email protected] Department of Informatics Engineering Faculty of Sciences and Technology University of Coimbra Coimbra, January 2015 Financial support by Fundação para a Ciência e a Tecnologia, through the PhD grant SFRH/BD/69106/2010. A Computational Model Inspired by Gene Regulatory Networks ©2015 Rui L. Lopes ISBN 978-989-20-5460-5 Cover image: Composition of a Santa Fe trail program evolved by ReNCoDe overlaid on the ancestors, with a 3D model of the DNA crystal structure (by Paul Hakimata). This dissertation was prepared under the supervision of Ernesto J. F. Costa Full Professor of the Department of Informatics Engineering of the Faculty of Sciences and Tecnology of the University of Coimbra In loving memory of my father. Acknowledgements Thank you very much to Prof. Ernesto Costa, for his vision on research and education, for all the support and contributions to my ideas, and for the many life stories that always lighten the mood. Thank you also to Nuno Lourenço for the many discussions, shared books, and his constant helpfulness.
    [Show full text]
  • Alternative Computational Models: a Comparison of Biomolecular and Quantum Computation
    Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation John H. Reif Department of Computer Science Duke University ∗ Abstract Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotechnology techniques, e.g. recombinant DNA operations. In contrast, Quantum Computation (QC) is a type of computation where unitary and measurement operations are executed on linear superpositions of basis states. Both BMC and QC may be executed at the micromolecular scale by a variety of methodologies and technologies. This paper surveys various methods for doing BMC and QC and discusses the considerable theoretical and practical advances in BMC and QC made in the last few years. We compare bounds on key resource such as time, volume (number of molecules times molecular density), energy and error rates achievable, taking particular note of the scalability of these methods with the size of the problem solved. In addition to NP search problems and database search problems, we enumerate a wide variety of further potential practical applications of BMC and QC. We observe that certain problems (e.g., NP search problems), if solved with polynomial time bounds, requires exponentially large volume for BMC, so BMC does not scale well to solve very large NP search problems. However, we describe a number of applications (e.g., search within large data bases and simu- lation of parallel machines) where the volume grows polynomial. Also, we note that the observation operation of QC, which is a fundamental operation of QC used for obtaining classical output, may potentially suffer from exponentially large volume requirements.
    [Show full text]
  • Solving Travelling Salesman Problem in a Simulation of Genetic Algorithms with Dna
    International Journal "Information Theories & Applications" Vol.15 / 2008 357 SOLVING TRAVELLING SALESMAN PROBLEM IN A SIMULATION OF GENETIC ALGORITHMS WITH DNA Angel Goñi Moreno Abstract: In this paper it is explained how to solve a fully connected N-City travelling salesman problem (TSP) using a genetic algorithm. A crossover operator to use in the simulation of a genetic algorithm (GA) with DNA is presented. The aim of the paper is to follow the path of creating a new computational model based on DNA molecules and genetic operations. This paper solves the problem of exponentially size algorithms in DNA computing by using biological methods and techniques. After individual encoding and fitness evaluation, a protocol of the next step in a GA, crossover, is needed. This paper also shows how to make the GA faster via different populations of possible solutions. Keywords: DNA Computing, Evolutionary Computing, Genetic Algorithms. ACM Classification Keywords: I.6. Simulation and Modeling, B.7.1 Advanced Technologies, J.3 Biology and Genetics Introduction In a short period of time DNA based computations have shown lots of advantages compared with electronic computers. DNA computers can solve combinatorial problems that an electronic computer cannot like the well known class of NP complete problems. That is due to the fact that DNA computers are massively parallel [Adleman, 1994]. However, the biggest disadvantage is that until now molecular computation has been used with exact and “brute force” algorithms. It is necessary for DNA computation to expand its algorithmic techniques to incorporate aproximative and probabilistic algorithms and heuristics so the resolution of large instances of NP complete problems will be possible.
    [Show full text]
  • Molecular and Neural Computation
    CSE590b: Molecular and neural computation Georg Seelig 1 Administrative Georg Seelig Grading: Office: CSE 228 30% class participation: ask questions. It’s more [email protected] fun if it’s interactive. TA: Kevin Oishi 30% Homework: Due at the end of class one week after they are handed out. Late policy: -10% each day for the first 3 days, then not accepted 40% Class project: A small design project using one (or several) of the design and simulation tools that will be introduced in class [email protected] Books: There is no single book that covers the material in this class. Any book on molecular biology and on neural computation might be helpful to dig deeper. https://www.coursera.org/course/compneuro 2 Computation can be embedded in many substrates Computaon controls physical Alternave physical substrates substrates (output of computaon is can be used to make computers the physical substrate) The molecular programming project The history of computing has taught us two things: first, that the principles of computing can be embodied in a wide variety of physical substrates from gears and springs to transistors, and second that the mastery of a new physical substrate for computing has the potential to transform technology. Another revolution is just beginning, one that will result in new types of programmable systems based on molecules. Like the previous revolutions, this “molecular programming revolution” will take much of its theory from computer science, but will require reformulation of familiar concepts such as programming languages and compilers, data structures and algorithms, resources and complexity, concurrency and stochasticity, correctness and robustness.
    [Show full text]
  • The Many Facets of Natural Computing
    The Many Facets of Natural Computing Lila Kari0 Grzegorz Rozenberg Department of Computer Science Leiden Inst. of Advanced Computer Science University of Western Ontario Leiden University, Niels Bohrweg 1 London, ON, N6A 5B7, Canada 2333 CA Leiden, The Netherlands [email protected] Department of Computer Science University of Colorado at Boulder Boulder, CO 80309, USA [email protected] “Biology and computer science - life and computation - are various natural phenomena. Thus, rather than being over- related. I am confident that at their interface great discoveries whelmed by particulars, it is our hope that the reader will await those who seek them.” (L.Adleman, [3]) see this article as simply a window onto the profound rela- tionship that exists between nature and computation. There is information processing in nature, and the natu- 1. FOREWORD ral sciences are already adapting by incorporating tools and Natural computing is the field of research that investi- concepts from computer science at a rapid pace. Conversely, gates models and computational techniques inspired by na- a closer look at nature from the point of view of information ture and, dually, attempts to understand the world around processing can and will change what we mean by computa- us in terms of information processing. It is a highly in- tion. Our invitation to you, fellow computer scientists, is to terdisciplinary field that connects the natural sciences with take part in the uncovering of this wondrous connection.1 computing science, both at the level of information tech- nology and at the level of fundamental research, [98]. As a matter of fact, natural computing areas and topics come in many flavours, including pure theoretical research, algo- 2.
    [Show full text]
  • The Nanobank Database Is Available at for Free Use for Research Purposes
    Forthcoming: Annals of Economics and Statistics (Annales d’Economie et Statistique), Issue 115/116, in press 2014 NBER WORKING PAPER SERIES COMMUNITYWIDE DATABASE DESIGNS FOR TRACKING INNOVATION IMPACT: COMETS, STARS AND NANOBANK Lynne G. Zucker Michael R. Darby Jason Fong Working Paper No. 17404 http://www.nber.org/papers/w17404 NATIONAL BUREAU OF ECONOMIC RESEARCH 1050 Massachusetts Avenue Cambridge, MA 02138 September 2011 Revised March 2014 The construction of Nanobank was supported under major grants from the National Science Foundation (SES- 0304727 and SES-0531146) and the University of California’s Industry-University Cooperative Research Program (PP9902, P00-04, P01-02, and P03-01). Additional support was received from the California NanoSystems Institute, Sun Microsystems, Inc., UCLA’s International Institute, and from the UCLA Anderson School’s Center for International Business Education and Research (CIBER) and the Harold Price Center for Entrepreneurial Studies. The COMETS database (also known as the Science and Technology Agents of Revolution or STARS database) is being constructed for public research use under major grants from the Ewing Marion Kauffman Foundation (2008- 0028 and 2008-0031) and the Science of Science and Innovation Policy (SciSIP) Program at the National Science Foundation (grants SES-0830983 and SES-1158907) with support from other agencies. Our colleague Jonathan Furner of the UCLA Department of Information Studies played a leading role in developing the methodology for selecting records for Nanobank. We are indebted to our scientific and policy advisors Roy Doumani, James R. Heath, Evelyn Hu, Carlo Montemagno, Roger Noll, and Fraser Stoddart, and to our research team, especially Amarita Natt, Hsing-Hau Chen, Robert Liu, Hongyan Ma, Emre Uyar, and Stephanie Hwang Der.
    [Show full text]
  • Info-Computational Philosophy of Nature
    Alan Turing’s Legacy: Info-Computational Philosophy of Nature Gordana Dodig-Crnkovic1 Abstract. Alan Turing’s pioneering work on computability, and Turing did not originally claim that the physical system his ideas on morphological computing support Andrew Hodges’ producing patterns actually performs computation through view of Turing as a natural philosopher. Turing’s natural morphogenesis. Nevertheless, from the perspective of info- philosophy differs importantly from Galileo’s view that the book computationalism, [3,4] argues that morphogenesis is a process of nature is written in the language of mathematics (The of morphological computing. Physical process, though not Assayer, 1623). Computing is more than a language of nature as computational in the traditional sense, presents natural computation produces real time physical behaviors. This article (unconventional), physical, morphological computation. presents the framework of Natural Info-computationalism as a contemporary natural philosophy that builds on the legacy of An essential element in this process is the interplay between the Turing’s computationalism. Info-computationalism is a synthesis informational structure and the computational process – of Informational Structural Realism (the view that nature is a information self-structuring. The process of computation web of informational structures) and Natural Computationalism implements physical laws which act on informational structures. (the view that nature physically computes its own time Through the process of computation, structures change their development). It presents a framework for the development of a forms, [5]. All computation on some level of abstraction is unified approach to nature, with common interpretation of morphological computation – a form-changing/form-generating inanimate nature as well as living organisms and their social process, [4].
    [Show full text]
  • Computing with DNA
    International Journal of Scientific and Research Publications, Volume 3, Issue 11, November 2013 1 ISSN 2250-3153 Computing With DNA Pratiyush Guleria NIELIT, Chandigarh, Extension Centre, Shimla, Himachal Pradesh, INDIA Abstract- This paper presents a DNA Computing potential in class of problems that is difficult or impossible to solve using areas of encryption, genetic programming, language systems, and traditional computing methods. It's an example of computation at algorithms. DNA computing takes advantage of DNA or related a molecular level, potentially a size limit that may never be molecules for storing information and biotechnological reached by the semiconductor industry. It demonstrates unique operations for manipulating this information. A DNA computer aspects of DNA as a data structure. It demonstrates that has extremely dense information storage capacity, provides computing with DNA can work in a massively parallel fashion. tremendous parallelism, and exhibits extraordinary energy In 2001, scientists at the Weizmann Institute of Science in Israel efficiency. DNA computing devices could revolutionize the announced that they had manufactured a computer so small that a pharmaceutical and biomedical fields. It involves application of single drop of water would hold a trillion of the machines. The information technology to the management of biological devices used DNA and enzymes as their software and hardware information. DNA Computing is brought into focus mainly and could collectively perform a billion operations a second. because of three research directions. First, the size of Now the same team, led by Ehud Shapiro, has announced a novel semiconductor devices approaches the scale of large model of its bimolecular machine that no longer requires an macromolecules.
    [Show full text]