epistemic meristem
56
32
epistemic meristem has not written any posts yet.
epistemic meristem has not written any posts yet.
(Though that notion assumes a Turing machine under the hood, so it's not a full-fledged alternative model of computation like lambda calculus.)
Excellent post! Related: "Why Not Sparse Hierarchical Graph Learning" by @beren.
Consider the various models of computation: Turing machines, lambda calculus, Boolean circuits, etc. They have different primitives - tapes, substitution rules, logic gates - but the Church-Turing thesis tells us they're equivalent.
Nit: the standard notion of Boolean circuit isn't Turing-complete.
EAs who shortened their timelines only after chatGPT had the intelligence of a houseplant
Nitpick: his actual comment only suggests that EAs whose current timelines are above 30 years are dumber than a potted plant. Furthermore, the intelligence threshold of non-potted houseplants is significantly lower, as they're generally too small to support recursive self-inflorescence
(There was already a linkpost.)
What are the most noteworthy sections to read? (Looks like you forgot to bold them.) Thanks!
The Amazon link in the post is for the third (and latest) edition, only $28. Your other links are for the second edition, except the Harvard link's dead.
Nope, it was Samuel Butler who wrote "Darwin Among the Machines."