An Intuitive Look at FP Soundness Public
Downloadable ContentDownload PDF
It is widely established that the program complexity class of functions whose runtimes are polynomial with respect to their input is considered tractable or efficient. This thesis establishes an intuitive look at pattern expansion, runtime expansion, and an architecture agnostic programming language sound in FP. This language is contrasted with logics known to be both sound and complete for FP and finally the idea of the all-encompassing or universal algorithm is considered in FP over an FP bounded language. Is there a program which can compute every problem solvable in polynomial time in polynomial time?
Permanent link to this page: https://digital.wpi.edu/show/2v23vx09s