Highlights of the rice-shapiro theorem in computable topology

Margarita Korovina, Oleg Kudinov

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

1 Citation (Scopus)

Abstract

Computable topological spaces naturally arise in computer science for continuous data type representations that have tools for effective reasoning about quite complex objects such as real numbers and functions, solutions of differential equations, functionals and operators. Algebraic and continuous domains, computable metric spaces, computable Polish spaces have been successfully used in the theoretical foundation of computer science. In this paper we consider generalisations of the famous Rice-Shapiro theorem in the framework of effectively enumerable topological spaces that contain the weakly-effective ω –continuous domains and computable metric spaces as proper subclasses. We start with the classical case when the spaces admit principal computable numberings of computable elements and one can investigate arithmetical complexity of index sets. We provide requirements on effectively enumerable topological spaces which guarantee that the Rice-Shapiro theorem holds for the computable elements of these spaces. It turns out that if we relax these requirements then the Rice-Shapiro theorem does not hold. Then we discuss the perspective of extensions of the Rice-Shapiro theorem to spaces that do not have computable numberings of computable elements, in particular to computable Polish spaces.

Original languageEnglish
Title of host publicationPerspectives of System Informatics - 11th International Andrei P. Ershov Informatics Conference, PSI 2017, Revised Selected Papers
EditorsAK Petrenko, A Voronkov
PublisherSpringer-Verlag GmbH and Co. KG
Pages241-255
Number of pages15
ISBN (Print)9783319743127
DOIs
Publication statusPublished - 1 Jan 2018
Event11th International Andrei Ershov Memorial Conference on Perspectives of System Informatics, PSI 2017 - Moscow, Russian Federation
Duration: 27 Jun 201729 Jun 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10742 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Andrei Ershov Memorial Conference on Perspectives of System Informatics, PSI 2017
CountryRussian Federation
CityMoscow
Period27.06.201729.06.2017

Keywords

  • Arithmetical complexity
  • Continuous data type
  • Program semantics
  • The Rise-Shapiro theorem
  • INDEX SETS
  • INSEPARABILITY

Fingerprint Dive into the research topics of 'Highlights of the rice-shapiro theorem in computable topology'. Together they form a unique fingerprint.

Cite this