Talk of John Case at the School of Computing, NUS, Singapore

Title: Computability, Complexity, Constructivity & Provability

Speaker: John Case

Date/Time: Monday 30 Sept 2013, 17:00 hrs

Location: NUS, SoC, MR 6 in AS6#05-10

Abstract:

Three minitalks will be presented on the topics
Non-Obfuscated Yet Unprovable Programs
Beyond Rogers’ Non-Constructively Computable Function
Uniformly Productive Sequences vs. Non-Constructive Disjunctions

(These are from joint work with Michael Ralston. The third one is also a
joint work with Yohji Akama.)

Leave a Reply

Your email address will not be published. Required fields are marked *

Time limit is exhausted. Please reload CAPTCHA.