First Page | Document Content | |
---|---|---|
![]() Date: 2010-03-29 15:27:54Theoretical computer science Mathematical logic Computable function Church–Turing thesis Function Algorithm Recursion Stephen Cole Kleene Computability Computability theory Mathematics Theory of computation | Source URL: www.ams.orgDownload Document from Source WebsiteFile Size: 275,84 KBShare Document on Facebook |
![]() | CSL’09 — Coimbra Informal Presentations Thursday, Sept 10 14:00–14:25 14:25–14:50DocID: 12fRI - View Document |
![]() | Microsoft Word - Poster-PeterC.docDocID: DAm7 - View Document |
![]() | A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events Dexter Kozen Department of Computer Science Cornell UniversityDocID: 996t - View Document |
![]() | Checking Format Compatibility of Programs Using Automata ByDocID: 4qt6 - View Document |
![]() | PDF DocumentDocID: 1CIe - View Document |