Bacterial computers move towards feasibility
The Hamiltonian Path Problem is to start at node 1, end at node 5,and visit each node exactly once. (For those without a bacterial computer the answer is 1→4→7→2→3→6→5).
Article Summary
Last year we looked at how a research team had genetically engineered Escherichia coli, (E. coli), bacteria to solve a classic mathematical puzzle known as the burnt pancake problem. At the time the researchers indicated their intention to adapt 'bacterial computers' for other, related math problems, and it appears they’ve been true to their word by solving another classic mathematical problem, the Hamiltonian Path Problem.
Related Articles
-
First living computer used for flipping pancakes
21st May, 2008
-
Nasty bacteria get gagged with plastic
17th May, 2010
-
Wonder why we don't crash like computers? Yale explains
11th May, 2010
-
The washable, bacteria-retardant keyboard
21st December, 2008
-
Cold plasma therapy could provide an alternative to antibiotics
21st December, 2010
-
'Glue' producing bacteria used to fill gaps in cracking concrete
17th November, 2010
