Back to Results
First PageMeta Content
Theory of computation / Computability theory / Functions and mappings / Recursion / Function / Computable number / Compact space / Subspace topology / Sierpiński space / Topology / Mathematics / General topology


Computable Real Analysis without Set Theory or Turing Machines Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR/S58522
Add to Reading List

Document Date: 2009-02-12 12:33:09

Open Document

File Size: 334,73 KB

Share Result on Facebook

Facility

Computer Science University of Manchester UK EPSRC GR/S58522 Foundational Methods / /

Organization

Turing Machines Paul Taylor Department / Computer Science University of Manchester UK EPSRC GR/S58522 Foundational Methods / /

Person

Fred Richman / Peter Schuster / Peter Hertling / Vasco Brattka / Martin Ziegler / Douglas Bridges / Hajime Ishihara / /

Position

Bishop / /

URL

www.cs.man.ac.uk/∼pt/ASD / /

SocialTag