this post was submitted on 01 Feb 2024
1 points (100.0% liked)
SneerClub
983 readers
5 users here now
Hurling ordure at the TREACLES, especially those closely related to LessWrong.
AI-Industrial-Complex grift is fine as long as it sufficiently relates to the AI doom from the TREACLES. (Though TechTakes may be more suitable.)
This is sneer club, not debate club. Unless it's amusing debate.
[Especially don't debate the race scientists, if any sneak in - we ban and delete them as unsuitable for the server.]
founded 1 year ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Taking a look at Super-recursive algorithm, and wow...
This reads like early-1990s conference proceedings out of the Santa Fe Institute, as seen through bong water.
This is literally the first sentence of the article, and it has a citation needed.
You can tell it's crankery solely based on the fact that the "definition" section contains zero math. Compare it to the definition section of an actual Turing machine.
More from the "super-recursive algorithm" page:
... the Hell?
I'm not sure what that page is trying to say, but it sounds like someone got Turing machines confused with pushdown automata.
That's plainly false btw. The model of a Turing machine with a write-only output tape is fully equivalent to the one where you have a read-write output tape. You prove that as a student in elementary computation theory.
The article is very poorly written, but here's an explanation of what they're saying. An "inductive Turing machine" is a Turing machine which is allowed to run forever, but for each cell of the output tape there eventually comes a time after which it never modifies that cell again. We consider the machine's output to be the sequence of eventual limiting values of the cells. Such a machine is strictly more powerful than Turing machines in that it can compute more functions than just recursive ones. In fact it's an easy exercise to show that a function is computable by such a machine iff it is "limit computable", meaning it is the pointwise limit of a sequence of recursive functions. Limit computable functions have been well studied in mainstream computer science, whereas "inductive Turing machines" seem to mostly be used by people who want to have weird pointless arguments about the Church-Turing thesis.
it’s hard to determine exactly what the author’s talking about most of the time, but a lot of the special properties they claim for inductive Turing machines and super-recursive algorithms appear to be just ordinary von Neumann model shit? also, they seem to be rather taken with the idea that you can modify and extend a Turing machine, but that’s not magic — it’s how I was taught the theoretical foundations for a bunch of CS concepts, like nondeterministic Turing machines and their relationship to NP-complete problems
New top-level thread for complaining about the worst/weirdest Wikipedia article in one's field of specialization?
I wonder how much Rationalists have mucked up Wikipedia over the years just by being loud and persistent on topics where actual expertise would be necessary to push back.
fuck yes I’m down! finally I’ve got a use for all the weird CS garbage I keep finding. do you figure this’d be better as a SneerClub or TechTakes thread?
Our house, our rules, I suppose... but maybe TechTakes is a better fit, unless the examples you have in mind seem rooted in TREACLES particularly.
as someone with an interest in non-Turing models of computation, reading that article made me feel how an amateur astronomer must feel after reading a paper trying to find a scientific justification for a flat earth