An Introduction to Implicit Computational Complexity Seminars/Workshops
Speaker: | Luck Ong |
---|---|
Time: | 2001-05-29 14:00:00 |
Place: | Rm.1211, IM Bldg. KAIST |
Abstract
Two lectures on
- implicit (resource-free) characterizations of PF, the class of all polynomial-time Turing computable numeric functions: Bellantoni-Cook function algebra BC, and Girard's Light Logic.
- a polytime-complete functional language based on the Light Logic.
Resources
[ List ]