Faculty Advisor

Cuneo, Joshua M

Faculty Advisor

Smith, Therese Mary

Abstract

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?

Publisher

Worcester Polytechnic Institute

Date Accepted

2020-05-15

Major

Computer Science

Project Type

Major Qualifying Project

Accessibility

Unrestricted

Advisor Department

Computer Science

Share

COinS