Follow

The Fastest and Shortest Algorithm for All Well-Defined Problems
Article by Hutter, Marcus
In collections: Attention-grabbing titles, Basically computer science
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and low-order additive terms. M optimally distributes resources between the execution of...
URL: hutter1.net/ai/pfastprg.htm
PDF: arxiv.org/pdf/cs/0206022.pdf
Entry: read.somethingorotherwhatever.

· · tooter · 0 · 1 · 0
Sign in to participate in the conversation
Mathstodon

The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!