[HN Gopher] How to Build an Origami Computer
___________________________________________________________________
How to Build an Origami Computer
Author : digital55
Score : 46 points
Date : 2024-01-30 15:58 UTC (7 hours ago)
(HTM) web link (www.quantamagazine.org)
(TXT) w3m dump (www.quantamagazine.org)
| kian wrote:
| So, then, protein folding is likely also possible to make Turing
| complete, no?
| bananabiscuit wrote:
| Protein folding is Turing complete because it can simulate a
| Turing machine by folding itself into a homo sapien, taking
| computation theory in college, and stepping through a Turing
| machine with a pen and paper for homework.
| kian wrote:
| I love this response. On a slightly smaller scale, there are
| also ideas of protein interaction-network computational
| 'circuitry' -- I think that showing that folding can also
| compute is a nice addendum to this.
| grow2grow wrote:
| Thank you for this excellent example, which I'll be using
| when defending my unpopular opinion that Occam's razor is
| nonsense.
| photonthug wrote:
| Thought this result was already established so maybe it's a new
| angle or simpler proofs? Obligatory Erik demaine linkage for
| those interested in more tho:
| https://ocw.mit.edu/courses/6-849-geometric-folding-algorith...
| https://erikdemaine.org/
| jksk61 wrote:
| now the question is: what is the most complex* object that it is
| not turing complete?
|
| * let's say you have n distinct rules acting against a set S, the
| complexity is n.
|
| p.s. probably something trivial exists such that you can take n
| as large as we wish to, so probably my definitions are not
| interesting.
| d--b wrote:
| I've thought origami was the way to prove p!=np for a while. Just
| waited for Erik Demaine to prove it though cause he's like a
| billion times smarter than I am.
___________________________________________________________________
(page generated 2024-01-30 23:01 UTC)