this post was submitted on 01 Feb 2024
18 points (100.0% liked)

SneerClub

991 readers
9 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
 

OpenAI blog post: https://openai.com/research/building-an-early-warning-system-for-llm-aided-biological-threat-creation

Orange discuss: https://news.ycombinator.com/item?id=39207291

I don't have any particular section to call out. May post thoughts ~~tomorrow~~ today it's after midnight oh gosh, but wanted to post since I knew ya'll'd be interested in this.

Terrorists could use autocorrect according to OpenAI! Discuss!

you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 3 points 10 months ago (7 children)

In computability theory, super-recursive algorithms are a generalization of ordinary algorithms that are more powerful, that is, compute more than Turing machines[citation needed]

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.

[–] [email protected] 3 points 10 months ago* (last edited 10 months ago) (6 children)

More from the "super-recursive algorithm" page:

Traditional Turing machines with a write-only output tape cannot edit their previous outputs; generalized Turing machines, according to Jürgen Schmidhuber, can edit their output tape as well as their work tape.

... 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.

[–] [email protected] 3 points 10 months ago (3 children)

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

[–] [email protected] 3 points 10 months ago* (last edited 10 months ago) (1 children)

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.

[–] [email protected] 2 points 10 months ago (1 children)

New top-level thread for complaining about the worst/weirdest Wikipedia article in one’s field of specialization?

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?

[–] [email protected] 3 points 10 months ago

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.

load more comments (1 replies)
load more comments (3 replies)
load more comments (3 replies)