Computability of finite simplicial complexes

DOI10.4230/LIPICS.ICALP.2022.111MaRDI QIDQ6560910zbMATH OpenFDO

Authors Mathieu Hoyrup

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.111

zbMATH Keywords

absolute neighborhood retractBing's housecomputable typedunce hatsimplicial complexsurjection propertytopological cone

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(3)

• Computable type of certain quotient spaces
• Computability of chainable graphs
• Computable type and computably categorical spaces

This page was built for publication: Computability of finite simplicial complexes

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