Computable approximations of semicomputable graphs

DOI10.46298/LMCS-22(1:28)2026MaRDI QIDQ7234395zbMATH OpenFDO

Authors Vedran Čačić, Matea Čelar, Marko Horvat, Zvonko Iljazovic

Publication date 28 April 2026

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-22(1:28)2026

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• An arithmetic analysis of closed surfaces
• Chainable and circularly chainable co-r.e. sets in computable metric spaces
• Compact manifolds with computable boundaries
• Computability of 1-manifolds
• Computability of graphs
• Computability of products of chainable continua
• Computability of Subsets of Metric Spaces
• Computability on computable metric spaces
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computability on subsets of metric spaces.
• Computable intersection points
• Computable neighbourhoods of points in semicomputable manifolds
• Computable subcontinua of semicomputable chainable Hausdorff continua
• COMPUTABLY COMPACT METRIC SPACES
• Effectiveness for embedded spheres and balls
• Elements of differential topology. With a foreword by F. Thomas Farrell.
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• Incomputability of Simply Connected Planar Continua
• On computable numbers, with an application to the Entscheidungsproblem.
• Semicomputable manifolds in computable topological spaces
• Singular coverings and non‐uniform notions of closed set computability

This page was built for publication: Computable approximations of semicomputable graphs

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