{"title":"Computable type and computably categorical spaces","authors":"Zvonko Iljazović , Patrik Vasung","doi":"10.1016/j.jco.2026.102026","DOIUrl":null,"url":null,"abstract":"<div><div>We examine effective separating sequences on a metric space and, in particular, conditions under which on a metric space every two such sequences are equivalent up to an isometry. Such a metric space is called computably categorical. We prove that an effectively compact metric space <span><math><mo>(</mo><mi>X</mi><mo>,</mo><mi>d</mi><mo>)</mo></math></span> is computably categorical if the space <span><math><mrow><mi>Iso</mi></mrow><mo>(</mo><mi>X</mi><mo>,</mo><mi>d</mi><mo>)</mo></math></span> of all isometries of <span><math><mo>(</mo><mi>X</mi><mo>,</mo><mi>d</mi><mo>)</mo></math></span> has computable type (which in particular holds if <span><math><mrow><mi>Iso</mi></mrow><mo>(</mo><mi>X</mi><mo>,</mo><mi>d</mi><mo>)</mo></math></span> is a manifold). Using this, we prove that each effectively compact subspace of Euclidean space is computably categorical.</div></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":"95 ","pages":"Article 102026"},"PeriodicalIF":1.8000,"publicationDate":"2026-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Complexity","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0885064X26000117","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/2/3 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
We examine effective separating sequences on a metric space and, in particular, conditions under which on a metric space every two such sequences are equivalent up to an isometry. Such a metric space is called computably categorical. We prove that an effectively compact metric space is computably categorical if the space of all isometries of has computable type (which in particular holds if is a manifold). Using this, we prove that each effectively compact subspace of Euclidean space is computably categorical.
期刊介绍:
The multidisciplinary Journal of Complexity publishes original research papers that contain substantial mathematical results on complexity as broadly conceived. Outstanding review papers will also be published. In the area of computational complexity, the focus is on complexity over the reals, with the emphasis on lower bounds and optimal algorithms. The Journal of Complexity also publishes articles that provide major new algorithms or make important progress on upper bounds. Other models of computation, such as the Turing machine model, are also of interest. Computational complexity results in a wide variety of areas are solicited.
Areas Include:
• Approximation theory
• Biomedical computing
• Compressed computing and sensing
• Computational finance
• Computational number theory
• Computational stochastics
• Control theory
• Cryptography
• Design of experiments
• Differential equations
• Discrete problems
• Distributed and parallel computation
• High and infinite-dimensional problems
• Information-based complexity
• Inverse and ill-posed problems
• Machine learning
• Markov chain Monte Carlo
• Monte Carlo and quasi-Monte Carlo
• Multivariate integration and approximation
• Noisy data
• Nonlinear and algebraic equations
• Numerical analysis
• Operator equations
• Optimization
• Quantum computing
• Scientific computation
• Tractability of multivariate problems
• Vision and image understanding.