The Fastest and Shortest Algorithm for All Well-Defined Problems · HackerPapers discussions

The Fastest and Shortest Algorithm for All Well-Defined Problems — HN submission

Sun, 28 Aug 2022 21:08:31 GMT

The Fastest And Shortest Algorithm For All Well-Defined Problems (2002)

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

The Fastest and Shortest Algorithm for All Well-Defined Problems — mentioned by srl

Wed, 26 May 2021 09:12:58 GMT

Here's the arxiv link: https://arxiv.org/abs/cs/0206022 (for anyone who shares my pet hatred for researchgate)

Paper and discussion history. A mention is not an endorsement.

The Fastest and Shortest Algorithm for All Well-Defined Problems — HN submission

Sun, 11 Aug 2019 17:22:07 GMT

The Fastest and Shortest Algorithm for All Well-Defined Problems (2002)

95 points; 14 discussion replies on HN. Paper and source history. A submission is not an endorsement.

The Fastest and Shortest Algorithm for All Well-Defined Problems — mentioned by voidmain

Sat, 29 Jun 2019 14:18:51 GMT

The Fastest and Shortest Algorithm for All Well-Defined Problems [1] 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. (The constants in the "low order" terms are... large. Basically this is a delightful reductio of asymptotic analysis) [1] https://arxiv.org/abs/cs/0206022

Paper and discussion history. A mention is not an endorsement.

The Fastest and Shortest Algorithm for All Well-Defined Problems — mentioned by pizza

Thu, 09 Feb 2017 19:45:47 GMT

"The Fastest and Shortest Algorithm for All Well-Defined Problems" https://arxiv.org/abs/cs/0206022

Paper and discussion history. A mention is not an endorsement.

The Fastest and Shortest Algorithm for All Well-Defined Problems — mentioned by theemathas

Mon, 30 Jan 2017 05:50:05 GMT

The Fastest and Shortest Algorithm for All Well-Defined Problems: https://arxiv.org/abs/cs/0206022 Abstract: 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 provably correct p-solving programs and an enumeration of all proofs, including relevant proofs of program correctness and of time bounds on program runtimes. M avoids Blum's speed-up theorem by ignoring programs without correctness proof. M has…

Paper and discussion history. A mention is not an endorsement.