undefined | Better HN

0 pointsdontlikeyoueith1y ago0 comments

A sufficiently large lookup table in DB is mathematically indistinguishable from a sufficiently complicated next token prediction algorithm is mathematically indistinguishable from general intelligence.

All that means is that treating something as a black box doesn't tell you anything about what's inside the box.

0 comments

4 comments · 1 top-level

int_19h1y ago· 3 in thread

Why do we care, so long as the box can genuinely reason about things?

chipsrafferty1y ago

What if the box has spiders in it

dontlikeyoueithOP1y ago

:facepalm:

I ... did you respond to the wrong comment?

Or do you actually think the DB table can genuinely reason about things?

int_19h1y ago

Of course it can. Reasoning is algorithmic in nature, and algorithms can be encoded as sufficiently large state transition tables. I don't buy into Searle's "it can't reason because of course it can't" nonsense.

2 more replies

j / k navigate · click thread line to collapse