Computability of sets in Euclidean space

DOI10.2478/PUMA-2022-0025MaRDI QIDQ5870588zbMATH OpenOpenAlexFDO

Authors Petrus H. Potgieter

Publication date 23 January 2023

Published in Pure Mathematics and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/puma-2022-0025

zbMATH Keywords

separabilityMandelbrot setimpossibility resultscomputable functioncomputability of sets

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Applications of computability and recursion theory (03D80)

Recommendations

• Computability on Regular Subsets of Euclidean Space
• Computability of Subsets of Metric Spaces
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Approximate decidability in euclidean spaces
• Computable operators on regular sets

Cited in

(2)

• Computably Isometric Spaces
• Computability on Regular Subsets of Euclidean Space

This page was built for publication: Computability of sets in Euclidean space

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