Computability and representations of the zero set

DOI10.1016/J.ENTCS.2008.12.005MaRDI QIDQ4918003zbMATH OpenOpenAlexFDO

Authors Pieter Collins

Publication date 3 May 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.entcs.2008.12.005

zbMATH Keywords

component cover representationcomputabilityindex theoryrobust zero set

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Constructive and recursive analysis (03F60)

Recommendations

• Persistence of zero sets
• Closed sets and operators thereon: representations, computability and complexity
• scientific article; zbMATH DE number 1107625
• scientific article; zbMATH DE number 3887669
• Computability on Subsets of Locally Compact Spaces

Cites work

• Computational homology
• Effective Borel measurability and reducibility of functions
• scientific article; zbMATH DE number 4102053 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 3221041 (Why is no real title available?)
• scientific article; zbMATH DE number 3343377 (Why is no real title available?)

Cited in

(12)

• Quasi-decidability of a fragment of the first-order theory of real numbers
• On the computability of the set of automorphisms of the unit square
• System design of stochastic models using robustness of temporal properties
• The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable
• Computing in Cantor’s Paradise with λ ZFC
• On computability and triviality of well groups
• scientific article; zbMATH DE number 4026680 (Why is no real title available?)
• scientific article; zbMATH DE number 4105274 (Why is no real title available?)
• Effective topological degree computation based on interval arithmetic
• Connected choice and the Brouwer fixed point theorem
• On computability and triviality of well groups
• Representations versus numberings: On the relationship of two computability notions

This page was built for publication: Computability and representations of the zero set

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