scientific article; zbMATH DE number 1969324
From MaRDI portal
Publication:4422786
zbMath1020.18005MaRDI QIDQ4422786
Publication date: 24 August 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cartesian closed categoriescomplexity theoryadmissibilitymultirepresentationsuniform weak limit spaces
Analysis of algorithms and problem complexity (68Q25) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)
Related Items
Computability of measurable sets via effective topologies ⋮ The fixed-point property for represented spaces ⋮ Computable Riesz Representation for the Dual of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>C</mml:mi><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false"></mml:mo></mml:math>] ⋮ Comparing Cartesian closed categories of (core) compactly generated spaces ⋮ Computable metrization ⋮ Base-Complexity Classifications of QCB $$_0$$ 0 -Spaces ⋮ Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) ⋮ Unnamed Item ⋮ On computability and disintegration ⋮ A comparison of concepts from computable analysis and effective descriptive set theory ⋮ A uniformly computable Implicit Function Theorem ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Stability of representations of effective partial algebras ⋮ Quantitative continuity and Computable Analysis in Coq ⋮ Observationally-induced lower and upper powerspace constructions ⋮ Computable Riesz Representation for Locally Compact Hausdorff Spaces ⋮ Effectivity on Continuous Functions in Topological Spaces ⋮ Comparing free algebras in topological and classical domain theory ⋮ Admissible Representations of Probability Measures ⋮ Observationally-induced Effect Monads: Upper and Lower Powerspace Constructions ⋮ Parametrised second-order complexity theory with applications to the study of interval computation ⋮ Computable analysis with applications to dynamic systems ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Continuous and monotone machines ⋮ On the computability of the set of automorphisms of the unit square ⋮ Representations and evaluation strategies for feasibly approximable functions ⋮ Unnamed Item ⋮ WEIHRAUCH GOES BROUWERIAN ⋮ On envelopes and backward approximations ⋮ Computability of Subsets of Metric Spaces ⋮ Admissibly Represented Spaces and Qcb-Spaces
