Can Large Language Models Reinvent Foundational Algorithms?

תקציר מקורי באנגליתarXiv:2604.05716v2 Announce Type: replace Abstract: LLMs have shown strong potential to advance scientific discovery. Whether they possess the capacity for foundational innovation, however, remains an open question. In this work, we focus on a prerequisite for foundational innovation: \textit{can LLMs reinvent foundational algorithms in computer science?} We use LLM unlearning methods to suppress direct recall of the target algorithm and let the model reason with the remaining knowledge to recover it. Although unlearning does not guarantee full knowledge removal, LLMs fail to recover nearly half of the target algorithms. Notably, even suppressing the mention of the algorithm's name during decoding without unlearning makes the models' recovery rate drop dramatically (19--39\%), suggesting t