Midterm 2 Flashcards
(101 cards)
who found that you could redefine what is meant by computation manipulating DNA to solve mathematical problems? What was his main finding in the paper?
Leonard M. Adleman
A UTM can be built with DNA molecules
What is the hamiltonian path problem?
Given a network of nodes and directed connections between them, is there a path through the network that begins with the start node and concludes with the end node visiting each node only once.
Binary (yes or no)
Generation and test method for hamiltonian problem with computer
Step 1: Generate random paths on the network.
Step 2: Keep only those paths that begin with the start
city and conclude with the end city.
Step 3: If there are N cities, keep only those paths of length N.
Step 4: Keep only those that enter all cities at least once.
Step 5. Any remaining paths are solutions (I.e., Hamiltonian
paths).
what is the issue with the generation and test method for a computer?
leads to combinatorial explosion. brute-force serial search takes a very long, virtually forever (unintelligent computation)
What is the key to solving the hamiltonian problem using DNA
performing the 5 steps in generation and test method in parallel search instead of serial
Who discovered the double helix and launched molecular biology?
Watson & Crick
anealing
complementary single-stranded DNA or RNA sequences spontaneously bind together by hydrogen bonds to form a double-stranded molecule
polymerases
copy information from one molecule into another
ligases
bind molecules together
used to repair breaks in DNA
DNA synthesis experiment
the “bio” nanomachines
-slides along
-reads each base
-writes its complement onto new strand
How did they encode the problem into DNA?
- In a test tube, mix the prepared DNA pieces together
(which will randomly link with each other, forming all different paths). - Perform PCR with ‘start’ and ‘end’ DNA pieces as primers (which creates millions’
copies of DNA strands with the right start and end). - Perform gel electrophoresis to identify only those pieces of right length (e.g., N=4).
- Use DNA ‘probe’ molecules to check whether their paths pass through all
intermediate cities. - All DNA pieces that are left in the tube should be precisely those representing
Hamiltonian paths. - If the tube contains any DNA at all, then conclude that a Hamiltonian path exists, and
otherwise not. When it does, the DNA sequence represents the specific path of the
solution.
Why does DNA work to solve the problem
its enormous parallelism
How many possible paths in the travelling salesman problem?
over 4 million
Working memory
Limited time capacity: contents of current awareness; storage mechanism that keeps a limited amount of information active fro a brief time such as a few seconds to minutes
acoustic
18 seconds duration
7+-/2 items capacity
Brown-peterson distractor task
Retention memory curve
participants count backwards by 3s during retention interval
memory span drops steeply because of retroactive interference
Modal model of memory (atkinson & shiffrin)
classical information-processing view
info -> sensory memory -> STM (maintenance via rehearsal which goes to LTM, or lost) -> LTM and retrieval back to STM
- modern model replaces STM with WM
Is there a ‘place’ in the brain for WM
No
WM is just referring to a concept or label for some sort of mental activities going on all over the brain, rather than a buffer place or loading dock
WM vs LTM
WM: temporary, fragile duration, limited capacity and size, relatively easy ease of entry, relatively easy ease of retrieval
LTM: long-lasting, enduring duration, virtually unlimited capacity and size, effortful ease of entry (rehearsal), ease of retrieval difficult and slow and can be unsuccessful
Waugh & Norman probe task
report digit after probe
serial position curve
Primacy effect - LTM
Recency effect - STM
List length effects
better recognition for shorter-list items
Computational modeling of serial position curves
SIMPLE model - Bayesian model
CMR model - connectionist model
Both model the same pattern
Evidence for separate stores of WM and LTM
error patterns ion memory tasks
double dissociations after brain lesions
H.M. Memory pattern
remembers old explicit memories formed before surgery but cannot form new explicit memories (severe anterograde)