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

Source URL: www.paultaylor.eu

• Mathematics
• Mathematical logic
• Computability theory
• Logic
• Theory of computation
• Computable number
• Structure
• Computable function
• Sigma-algebra

Foundations for Computable Topology Paul Taylor 8 April 2009 Abstract Foundations should be designed for the needs of mathematics and not vice versa. We propose a technique for doing this that exploits the correspondence

Source URL: www.monad.me.uk

Foundations for Computable Topology Paul Taylor 8 April 2009 Abstract Foundations should be designed for the needs of mathematics and not vice versa. We propose a technique for doing this that exploits the correspondence

Source URL: www.paultaylor.eu

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

Source URL: www.paultaylor.eu

• 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

Source URL: www.paultaylor.eu

• Theory of computation
• Mathematical logic
• General topology
• Functional analysis
• Computable number
• Computable function
• Continuous function
• Baire space
• Topological space
• Computability theory
• Mathematics
• Topology

Integrating the TDBU-ETSAP models in MCP format ETSAP Workshop on “Economic impacts of hybrid energy-economy models” Copenhagen, Denmark, 19th of November, 2014 E. Panos and S. Kypreos, PSI

Source URL: www.iea-etsap.org

• Functional analysis
• Numerical analysis
• Topology
• Operations research
• Mathematics
• Burroughs MCP
• Computable general equilibrium
• Economic model
• General equilibrium theory
• Mathematical analysis
• Mathematical optimization
• Complementarity theory

Computability of continuous solutions of higher-type equations Mart´ın Escard´o School of Computer Science, University of Birmingham, UK Abstract. Given a continuous functional f : X → Y and y ∈ Y , we wish

Source URL: www.cs.bham.ac.uk

• Theory of computation
• Theoretical computer science
• Metric space
• Computable function
• Uniform space
• Filter
• Continuous function
• Mathematics
• Computability theory
• Topology

CAT(0) IS AN ALGORITHMIC PROPERTY MURRAY ELDER AND JON MCCAMMOND1 Abstract. In this article we give an explicit algorithm which will determine, in a discrete and computable way, whether a finite piecewise Euclidean compl

Source URL: www.math.ucsb.edu

• Differential topology
• Geometric group theory
• Differential geometry
• Geometric topology
• Geodesic
• Riemann surfaces
• Tangent space
• Orbifold
• Stallings theorem about ends of groups
• Geometry
• Topology
• Mathematics

Report from Dagstuhl Seminar[removed]Computing with Infinite Data: Topological and Logical

Source URL: drops.dagstuhl.de

• Topology
• Functional analysis
• General topology
• Theory of computation
• Descriptive set theory
• Computable analysis
• Computable function
• Mathematical analysis
• Baire space
• Mathematics
• Mathematical logic
• Computability theory

The Realizability Approach to Computable Analysis and Topology Andrej Bauer

Source URL: andrej.com

• Mathematical constructivism
• Logic in computer science
• Algebraic structures
• Realizability
• Categorical logic
• Function
• Intuitionistic logic
• Combinatory logic
• First-order logic
• Mathematical logic
• Mathematics
• Logic