Computer Science – Computational Complexity
Scientific paper
2001-02-21
Workshop on Mathematical approaches to Biological Computation (MaBiC 2001) and Workshop on Algorithmic Information Theory (TAI
Computer Science
Computational Complexity
10 LaTeX pages
Scientific paper
The provably asymptotically fastest algorithm within a factor of 5 for formally described problems will be constructed. The main idea is to enumerate all programs provably equivalent to the original problem by enumerating all proofs. The algorithm could be interpreted as a generalization and improvement of Levin search, which is, within a multiplicative constant, the fastest algorithm for inverting functions. Blum's speed-up theorem is avoided by taking into account only programs for which a correctness proof exists. Furthermore, it is shown that the fastest program that computes a certain function is also one of the shortest programs provably computing this function. To quantify this statement, the definition of Kolmogorov complexity is extended, and two new natural measures for the complexity of a function are defined.
No associations
LandOfFree
An effective Procedure for Speeding up Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An effective Procedure for Speeding up Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An effective Procedure for Speeding up Algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-726534