Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Engineering
Which Algorithms Are Feasible? Maxent Approach, Daniel E. Cooke, Vladik Kreinovich, Luc Longpre
Which Algorithms Are Feasible? Maxent Approach, Daniel E. Cooke, Vladik Kreinovich, Luc Longpre
Departmental Technical Reports (CS)
It is well known that not all algorithms are feasible; whether an algorithm is feasible or not depends on how many computational steps this algorithm requires. The problem with the existing definitions of feasibility is that they are rather ad hoc. Our goal is to use the maximum entropy (MaxEnt) approach and get more motivated definitions.
If an algorithm is feasible, then, intuitively, we would expect the following to be true:
If we have a flow of problems with finite average length L, then we expect the average time T to be finite as well.
Thus, we can say …