<--- Back to Details
First PageDocument Content
Mathematical logic / Computable number / Computable analysis / Computable real function / Low / Turing machine / Computable measure theory / Computability / Computable function / Computability theory / Theoretical computer science / Theory of computation
Date: 2010-01-12 23:03:20
Mathematical logic
Computable number
Computable analysis
Computable real function
Low
Turing machine
Computable measure theory
Computability
Computable function
Computability theory
Theoretical computer science
Theory of computation

 Sino-Germany Project July, 2005

Add to Reading List

Source URL: www.ims.nus.edu.sg

Download Document from Source Website

File Size: 573,41 KB

Share Document on Facebook

Similar Documents

Lines Missing Every Random Point∗ Jack H. Lutz† Neil Lutz‡  Abstract

Lines Missing Every Random Point∗ Jack H. Lutz† Neil Lutz‡ Abstract

DocID: 1qlxM - View Document

PDF Document

DocID: 1pZ37 - View Document

A computable axiomatisation of the topology of R and C Paul Taylor 6 August 2009

A computable axiomatisation of the topology of R and C Paul Taylor 6 August 2009

DocID: 1pMn0 - View Document

Microsoft Word - IBSAlgorithms.doc

Microsoft Word - IBSAlgorithms.doc

DocID: 1p3sE - View Document

Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second,

Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second,

DocID: 1oyBY - View Document