First Page | Document Content | |
---|---|---|
Date: 2008-08-19 05:08:00Computability theory Computable function Computable analysis Recursively enumerable set Oracle machine Computability High Reduction Mathematical logic | Fifth Internation Conference on Computability and Complexity in Analysis August 21-24, 2008, Hagen, Germany provisional programmeAdd to Reading ListSource URL: cca-net.deDownload Document from Source WebsiteFile Size: 11,35 KBShare Document on Facebook |
arXiv:1512.03024v2 [cs.LO] 8 DecComparing representations for function spaces in computable analysis Arno PaulyDocID: 1sRZe - View Document | |
A brief introduction to Higher Order Logic and the HOL proof assistant Monica NesiDocID: 1rjEK - View Document | |
Lines Missing Every Random Point∗ Jack H. Lutz† Neil Lutz‡ AbstractDocID: 1qlxM - View Document | |
PDF DocumentDocID: 1pZ37 - View Document | |
A computable axiomatisation of the topology of R and C Paul Taylor 6 August 2009DocID: 1pMn0 - View Document |