A paper written by the former CTO of tech giant SAP and his son claims to mathematically prove that large language mode…
From @futurism on Instagram — 1.2M followers · See full profile →
A paper written by the former CTO of tech giant SAP and his son claims to mathematically prove that large language models “are incapable of carrying out computational and agentic tasks beyond a certain complexity” — that level of complexity being, crucially, pretty low. And the co-author, Vishal Sikka, knows a thing or two about AI. He studied under John McCarthy, the Turing Award-winning computer scientist who literally founded the entire field of artificial intelligence, and in fact…