Gary Marcus

Rank 13 of 47

Score 83

Demonstration of how o1 can literally be billions, perhaps trillions, of times less efficient than conventional computation, via @plibin. (Full thread explains that estimate.)

Phil Libin

@plibin

486d

I may have just carried out literally the least-efficient calculation in the history of computing. I’m impressed, amused, bewildered, and a little sad. I asked o1 to add two (non-random) 64-bit numbers. It got the correct answer after 82 seconds of anthropomorphic soul-searching.

9/14/2024, 5:39:40 PM

The statement and the referenced conversation primarily focus on a technical demonstration and personal experience related to computational efficiency. It does not engage substantively with public issues, policies, or societal concerns, and therefore does not constitute public discourse.