scientific article; zbMATH DE number 1969324

zbMATH Open1020.18005MaRDI QIDQ4422786FDOQ4422786

Authors: Matthias Schröder 

Publication date: 24 August 2003

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1746044
• scientific article; zbMATH DE number 3887669
• Extended admissibility.
• Logical Approaches to Computational Barriers
• Effectivity in Spaces with Admissible Multirepresentations

zbMATH Keywords

complexity theoryCartesian closed categoriesadmissibilitymultirepresentationsuniform weak limit spaces

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Cited In (37)

• Continuous and monotone machines
• Effectivity on continuous functions in topological spaces
• On envelopes and backward approximations
• Comparing free algebras in topological and classical domain theory
• Computability of measurable sets via effective topologies
• Parametrised second-order complexity theory with applications to the study of interval computation
• A natural weak limit space with admissible representation which is not a limit space
• Admissibly Represented Spaces and Qcb-Spaces
• Computability of Subsets of Metric Spaces
• Computable analysis and notions of continuity in \textsc{Coq}
• Computable Riesz representation for locally compact Hausdorff spaces
• Weihrauch goes Brouwerian
• Observationally-induced lower and upper powerspace constructions
• Computable Riesz representation for the dual of \(C[0;1]\)
• The fixed-point property for represented spaces
• Title not available (Why is that?)
• Representations and evaluation strategies for feasibly approximable functions
• Topological properties of real number representations.
• Admissible representations of probability measures
• A uniformly computable Implicit Function Theorem
• A computable and compositional semantics for hybrid systems
• Observationally-induced effect monads: upper and lower powerspace constructions
• On computability and disintegration
• A comparison of concepts from computable analysis and effective descriptive set theory
• Computable metrization
• Title not available (Why is that?)
• Stability of representations of effective partial algebras
• Comparing Cartesian closed categories of (core) compactly generated spaces
• Quantitative continuity and Computable Analysis in Coq
• Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
• Computable analysis with applications to dynamic systems
• Base-complexity classifications of \(\mathrm{qcb}_0\)-spaces
• Connected choice and the Brouwer fixed point theorem
• On the computability of the set of automorphisms of the unit square
• Extended admissibility.
• Quantitative coding and complexity theory of compact metric spaces
• Computability on the countable ordinals and the Hausdorff-Kuratowski theorem (extended abstract)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4422786)