God, Physics and the Natural-Computer Natural Algorithms Joshua Arulanandham Computer Science.

Slides:



Advertisements
Similar presentations
Simulation Examples in EXCEL Montana Going Green 2010.
Advertisements

Data collected over a period of time Example Data seems pretty random!!
Lecture 9. Resource bounded KC K-, and C- complexities depend on unlimited computational resources. Kolmogorov himself first observed that we can put resource.
FlowNet FlowNet is a Microsoft Windows-based computer-aided engineering program for fluid flow calculations. It automatically configures a simulation flow.
Control Structures Control structures are used to manage the order in which statements in computer programs will be executed Three different approaches.
Introducing Natural Algorithms. A passionate affair Nature and Numbers – Friends for ever! I started it !
Weight of Water Imagine an inverted test tube with a column of water in it. The volume above the water is empty (no air). The piston underneath is free.
Math 308 Discrete Mathematics Discrete Mathematics deals with “Separated” or discrete sets of objects (rather than continuous sets) Processes with a sequence.
1 Module 13 Studying the internal structure of REC, the set of solvable problems –Complexity theory overview –Automata theory preview Motivating Problem.
FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY Read sections 7.1 – 7.3 of the book for next time.
25.All-Pairs Shortest Paths Hsu, Lih-Hsing. Computer Theory Lab. Chapter 25P.2.
Algorithmic Complexity Fawzi Emad Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
© Peter Andreae CS4HS Algorithms Searching for an item in a list Sorting a list Searching for a word in text Analysing Networks.
Buckingham Pi Theorem This example is the same as example 7.2 in the textbook except that we assume the pipe is a smooth pipe. Using Buckingham Pi theorem,
Solving SAT. Two kinds of (computing) problems “Calculator” problems Problems solvable using the application of a set of well-defined operations ( functions.
Using Motion Planning to Study Protein Folding Pathways Susan Lin, Guang Song and Nancy M. Amato Department of Computer Science Texas A&M University
Governor’s School for the Sciences Mathematics Day 13.
SCIENCE VOCABULARY REVIEW. All the non-living matter in an environment. Abiotic.
Approximation Algorithms Pages ADVANCED TOPICS IN COMPLEXITY THEORY.
Natural Algorithms Joshua J. Arulanandham Supervisors: Professor Cristian S. Calude and Dr. Michael J. Dinneen.
1. The Role of the Algorithms in Computer Algorithms – 1/2 Algorithm: Any well-defined computation procedure that takes some value, or set of values,
CSC 172 P, NP, Etc. “Computer Science is a science of abstraction – creating the right model for thinking about a problem and devising the appropriate.
Complexity Non-determinism. NP complete problems. Does P=NP? Origami. Homework: continue on postings.
Bead Sort Animation Sorting {3, 1, 2}Sorting {2, 3, 1}Sorting {1, 3, 2}Sorting {1, 3, 2, 4}Sorting {2, 4, 3, 2} Choose a link:
IB Computer Science – Logic
Teacher Talk There has never been a better time to teach Computer Science 2.We can learn from Chemistry, Physics, Biology, …
Sequencing The most simple type of program uses sequencing, a set of instructions carried out one after another. Start End Display “Computer” Display “Science”
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
“One ring to rule them all” Analogy (sort of) Lord of The Rings Computational Complexity “One problem to solve them all” “my preciousss…”
NATURAL ALGORITHMS Joshua J. Arulanandham, PhD student. Prof. Cristian S. Calude and Dr. Michael J. Dinneen, Supervisors. Department of Computer Science,
Polish Infrastructure for Supporting Computational Science in the European Research Space EUROPEAN UNION Examining Protein Folding Process Simulation and.
Higher Computing Science 2016 Prelim Revision. Topics to revise Computational Constructs parameter passing (value and reference, formal and actual) sub-programs/routines,
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
Monte Carlo Simulation of Folding Processes for 2D Linkages Modeling Proteins with Off-Grid HP-Chains Ileana Streinu Smith College Leo Guibas Rachel Kolodny.
CS Class 04 Topics  Selection statement – IF  Expressions  More practice writing simple C++ programs Announcements  Read pages for next.
Free Fall Acceleration due to Gravity. Free Fall l What causes things to fall? l How fast do things fall? l How far do things fall in a given time?
CSCI 2670 Introduction to Theory of Computing
Proteins.
Cellular automata.
Trapezoid Method and Iteration & Acceleration
Computational Molecular Modelling
Greedy Technique.
Shortest Path from G to C Using Dijkstra’s Algorithm
Course Description Algorithms are: Recipes for solving problems.
Introduction to Computer Science - Alice
Samuel Luckenbill1, Ju-Yueh Lee2, Yu Hu3, Rupak Majumdar1, and Lei He2
Notes 1: Measuring Motion
D I s , a ·.... l8l8.
Amino Acids as Protein Building Blocks
Cells CDT Questions.
Determine protein structure from amino acid sequence
More Graph Algorithms.
CS223 Advanced Data Structures and Algorithms
كلية المجتمع الخرج البرمجة - المستوى الثاني
Physics-based simulation for visual computing applications
What are models and simulations?
Making Change Coins: 2 and
I ll I
HPD Model for Protein Structure Simulation
' 1 A ./.\.l+./.\.l
Sorting and Divide-and-Conquer
Analysis of Algorithms Growth Rates
Lecture 6 Shortest Path Problem.
What DNA sequence codes for this chain of amino acids...?
Course Description Algorithms are: Recipes for solving problems.
The Shortest Path Algorithm
Four Levels of Protein Structure
Presentation transcript:

God, Physics and the Natural-Computer Natural Algorithms Joshua Arulanandham Computer Science

The wonders of the world come in two flavours!

How water “finds” the average Water finds the same level in all limbs due to atmospheric pressure. l1l1 l2l2 l3l3 (l 1 + l 2 + l 3 ) / 3

How to make a “computer” with beads, rods and gravity ++=

A “computer” that runs on gravity

Sorting {3, 1, 2} 2. Drop 1 bead 3. Drop 2 beads 1. Drop 3 beads (Remember, always from left-to-right) A “computer” that runs on gravity

Sorting {2, 4, 3, 2} 2. Drop 4 beads 3. Drop 3 beads 1. Drop 2 beads (Remember, always from left-to-right) 4. Drop 2 beads A “computer” that runs on gravity

90 0 The bead-sort computer The “tilt” operation

Calculating shortest path using strings and beads A B (Source) C D E (Destination) E (Destination)Shortestpath As the source, destination nodes in the physical graph-model are stretched apart, the shortest path forms a straight line between them.

A computer made of pipes and pistons Is (~a + b)(a + b) satisfiable? a b (~a + b) (a + b) (~a + b) (a + b) ab (a + b) ~ab (~a + b)

“Physics is like sex. Sure, it may give some practical results, but that's not why we do it.” Why natural algorithms?

Which is easier: flipping a coin or its numerical simulation?

Given a linear sequence of amino acids, into what three dimensional configuration will the sequence fold? Which is faster: protein folding or its numerical simulation?

A new vocabulary Boolean logic, automata theory, etc. Natural physical processes

“It’s not that the bear dances so well, it’s that he dances at all.” My Natural-Computer versus your PC !