The Turing Closure of an Archimedean Field Paolo Boldi∗ Sebastiano Vigna∗ Abstract

First Page		Document Content
Date: 2002-05-18 04:52:19 Applied mathematics Theory of computation Alan Turing Models of computation Turing machine Computability Turing degree Computable number Reduction Theoretical computer science Computability theory Computer science		The Turing Closure of an Archimedean Field Paolo Boldi∗ Sebastiano Vigna∗ Abstract Add to Reading List Source URL: vigna.di.unimi.it Download Document from Source Website File Size: 114,49 KB Share Document on Facebook

	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 DocID: 1pMn0 - View Document
	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, DocID: 1oyBY - View Document