Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Victor L. Selivanov"'
Publikováno v:
Computability. 10:123-140
We establish upper bounds of bit complexity of computing solution operators for symmetric hyperbolic systems of PDEs. Here we continue the research started in in our revious publications where computability, in the rigorous sense of computable analys
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af81b6c90872d6cce16c10f993e58872
https://doi.org/10.3233/com-180215
https://doi.org/10.3233/com-180215
Autor:
Victor L. Selivanov
Publikováno v:
Computability. 9:327-341
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a73bbcffd09710254bebefc8ac702e79
https://doi.org/10.3233/com-180241
https://doi.org/10.3233/com-180241
Autor:
Victor L. Selivanov, Alexander Okhotin
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783030794156
CSR
CSR
Automata operating on strings of nested brackets, known as input-driven pushdown automata, and also as visibly pushdown automata, have been studied since the 1980s. They were extended to the case of infinite strings by Alur and Madhusudan (“Visibly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::adff81d3123b201c5887cb42cfbf5d93
https://doi.org/10.1007/978-3-030-79416-3_21
https://doi.org/10.1007/978-3-030-79416-3_21
Publikováno v:
Computer Algebra in Scientific Computing ISBN: 9783030851644
CASC
CASC
We establish primitive recursive versions of some known facts about computable ordered fields of reals and computable reals and apply them to several problems of algebra and analysis. In particular, we find a primitive recursive analogue of Ershov-Ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e7531c55724aa5e8fc59c90859d0786
https://doi.org/10.1007/978-3-030-85165-1_20
https://doi.org/10.1007/978-3-030-85165-1_20
Autor:
Victor L. Selivanov
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030800482
CiE
CiE
We study the recently suggested effective Wadge hierarchy in effective spaces, concentrating on the non-collapse property. Along with hierarchies of sets, we study hierarchies of k-partitions which are interesting on their own. In particular, we esta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ef2db6b7bc1d8274ba4f5b3bc03e30c
https://doi.org/10.1007/978-3-030-80049-9_40
https://doi.org/10.1007/978-3-030-80049-9_40
Autor:
Pavel Alaev, Victor L. Selivanov
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030800482
CiE
CiE
We systematise notions and techniques needed for development of the computable structure theory towards applications such as symbolic algorithms and on-line algorithms. On this way, we introduce some new notions and investigate their relation to the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d2b7678d24daa74a3b66b4ead58df5e
https://doi.org/10.1007/978-3-030-80049-9_1
https://doi.org/10.1007/978-3-030-80049-9_1
Autor:
Victor L. Selivanov
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783030625351
DCFS
DCFS
We develop a theory of \(\omega \)-regular aperiodic k-partitions (for arbitrary \(k\ge 2\)) that extends existing results for the \(\omega \)-regular k-partitions and for the fine hierarchy of regular aperiodic \(\omega \)-languages (which coincide
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1735c862b921b7e710ae7ec3a85cda65
https://doi.org/10.1007/978-3-030-62536-8_16
https://doi.org/10.1007/978-3-030-62536-8_16
Autor:
Victor L. Selivanov
Publikováno v:
Trends in Logic ISBN: 9783030302283
We discuss some applications of WQOs to several fields were hierarchies and reducibilities are the principal classification tools, notably to Descriptive Set Theory, Computability theory and Automata Theory. While the classical hierarchies of sets us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01adea2ecceaf9d1b70650c538b22e71
https://doi.org/10.1007/978-3-030-30229-0_10
https://doi.org/10.1007/978-3-030-30229-0_10
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030514655
CiE
CiE
There are continuum many homeomorphism types of Polish spaces. In particular, there is a Polish space which is not homeomorphic to any computably presented Polish space. We examine the details of degrees of non-computability of presenting homeomorphi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf6f7d6a59c7ce204259a389c5e9d4a8
https://doi.org/10.1007/978-3-030-51466-2_16
https://doi.org/10.1007/978-3-030-51466-2_16
Autor:
Victor L. Selivanov, Mars M. Yamaleev
Publikováno v:
Computability. 7:289-300
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e895a07ad594ae5ae152ffc5fd590c7
https://doi.org/10.3233/com-180085
https://doi.org/10.3233/com-180085