<--- Back to Details
First PageDocument Content
John V. Tucker / Computer science / Computability theory / Logic / Viggo Stoltenberg-Hansen / Mathematical logic / Computable function / Computability / Theoretical computer science / Theory of computation / Alumni of the University of Bristol
Date: 2008-06-11 09:22:18
John V. Tucker
Computer science
Computability theory
Logic
Viggo Stoltenberg-Hansen
Mathematical logic
Computable function
Computability
Theoretical computer science
Theory of computation
Alumni of the University of Bristol

CiE Athens 2008 Applied Computability: A European Perspective J V Tucker Swansea University General Reflections on Models J V Tucker and J I Zucker, Abstract versus concrete computability: The case of countable

Add to Reading List

Source URL: www-compsci.swan.ac.uk

Download Document from Source Website

File Size: 65,91 KB

Share Document on Facebook

Similar Documents

arXiv:1512.03024v2 [cs.LO] 8 DecComparing representations for function spaces in computable analysis Arno Pauly

arXiv:1512.03024v2 [cs.LO] 8 DecComparing representations for function spaces in computable analysis Arno Pauly

DocID: 1sRZe - View Document

A brief introduction to Higher Order Logic and the HOL proof assistant Monica Nesi

A brief introduction to Higher Order Logic and the HOL proof assistant Monica Nesi

DocID: 1rjEK - View Document

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