MoL-2018-23: Gijzen, Marlou M. (2018) A Constructive Approach Towards Formalizing Relativization Using Combinatory Logic. [Report]
Preview |
Text
MoL-2018-23.text.pdf Download (516kB) | Preview |
Abstract
We present a formal system, ACT, that is used to express the time-complexity of computing functions. Every proof that can be made within the system relativizes. The system uses combinatory logic instead of Turing machines. We do show that it is invariant with respect to Turing machines.
We obtained that ACT is conservative over HA. We also present an extension to the system that allows for the usage of diagonalization. We then show that the P vs NP problem is independent from this system.
| Item Type: | Report |
|---|---|
| Report Nr: | MoL-2018-23 |
| Series Name: | Master of Logic Thesis (MoL) Series |
| Year: | 2018 |
| Subjects: | Computation Logic |
| Depositing User: | Dr Marco Vervoort |
| Date Deposited: | 11 Oct 2018 14:14 |
| Last Modified: | 11 Oct 2018 14:14 |
| URI: | https://eprints.illc.uva.nl/id/eprint/1637 |
Actions (login required)
 |
View Item |
