←back to thread

Is life a form of computation?

(thereader.mitpress.mit.edu)
222 points redeemed | 1 comments | | HN request time: 0.401s | source
Show context
eig ◴[] No.45354099[source]
I'm not too impressed with this article since it doesn't really give a definition for computing, just picks a few similarities between what we see as computing (in the practical sense) and what cells do.

It's a shame because there *has* been a lot of deep work done on what kind of computer life is. People often use the Chomsky Hierarchy (https://en.wikipedia.org/wiki/Chomsky_hierarchy) to define the different types of computer vs automata. Importantly, a classical Turing machine is Type-0 on the Chomsky Hierarchy. Depending on what parts you include from a biological system, you could argue it's anywhere from Type-0 to Type-4.

Interestingly, the PhD thesis of well-known geneticist Aviv Regev was to show that certain combinations of enzymes with chemical concentration states are enough to emulate pi-calculus, and therefore are Turing machines! https://psb.stanford.edu/psb-online/proceedings/psb01/regev....

replies(2): >>45354396 #>>45377065 #
1. YeGoblynQueenne ◴[] No.45377065[source]
The Aviv Regev paper you link was recently recommended to me as a useful reference for something. It was a nice surprise to see that Regev's thesis advisor was Ehud Shapiro, known to the Prolog community from his co-authorship of one of the good Prolog books (The Art of Prolog, with Leon Sterling - https://mitpress.mit.edu/9780262691635/the-art-of-prolog/). Indeed, Regev's thesis (and the paper above) propose a system based on a Flat Concurrent Prolog.

Shapiro was also the author of one of the two PhD theses that were a major influence to Inductive Logic Programming, a field at the intersection of logic programming and machine learning.

A lot of the kind of "deep work" you mention used to be done in the logic programming and ILP community in times past, before everyone seemingly switched to neural nets and statistical machine learning.