The complexity of specifying computable approximations of points of a metric space

MaRDI QIDQ1165843zbMATH OpenFDO

Authors Vladimir Nikolaevich Krupskiĭ

Publication date 1981

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

effective systems

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Other constructive mathematics (03F65) Metric spaces, metrizability (54E35)

This page was built for publication: The complexity of specifying computable approximations of points of a metric space

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