Computer Science – Computational Complexity
Scientific paper
2012-04-25
Computer Science
Computational Complexity
12 pages, 2 figures
Scientific paper
This paper proposes a method to find efficient bounded algorithms of NPC problems by machine enumeration. The key contributions are: * On Universal Turing Machines, a program's time complexity should be characterized as: execution time(n) = loading time(n) + running time(n). * Introduces the concept of bounded algorithms; proposes a comparison based criterion to decide if a bounded algorithm is inefficient; and establishes the length upper bound of efficient bounded programs. * Introduces a new way to evaluate program complexity by using the growth rate characteristic function, which is more easily machine checkable based on observations.
No associations
LandOfFree
The program complexity on Universal Turing Machines, and a proposal to find efficient n-bounded algorithms of NPC problems by machine enumeration 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 The program complexity on Universal Turing Machines, and a proposal to find efficient n-bounded algorithms of NPC problems by machine enumeration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The program complexity on Universal Turing Machines, and a proposal to find efficient n-bounded algorithms of NPC problems by machine enumeration will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-137537