191 - 200 out of 205Page size: 10
Sort by: Title

  1. Turing computable embeddings, computable infinitary equivalence, and linear orders

    Bazhenov, N., 1 Jan 2017, Unveiling Dynamics and Complexity - 13th Conference on Computability in Europe, CiE 2017, Proceedings. Kari, J., Manea, F. & Petre (eds.). Springer-Verlag GmbH and Co. KG, Vol. 10307 LNCS. p. 141-151 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10307 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  2. Turing Degrees and Automorphism Groups of Substructure Lattices

    Dimitrov, R. D., Harizanov, V. & Morozov, A. S., 1 Mar 2020, In: Algebra and Logic. 59, 1, p. 18-32 15 p.

    Research output: Contribution to journal › Article › peer-review

  3. Turing Degrees of Complete Formulas of Almost Prime Models

    Goncharov, S. S., Miller, R. & Harizanov, V., 1 Jul 2019, In: Algebra and Logic. 58, 3, p. 282-287 6 p.

    Research output: Contribution to journal › Article › peer-review

  4. Unified Formalization of «natural» Classification, «natural» Concepts, and Consciousness as Integrated Information by Giulio Tononi

    Vityaev, E., 2015, In: Procedia Computer Science. 71, p. 169-177 9 p.

    Research output: Contribution to journal › Conference article › peer-review

  5. Universal Functions and Unbounded Branching Trees

    Khisamiev, A. N., 1 Sept 2018, In: Algebra and Logic. 57, 4, p. 309-319 11 p.

    Research output: Contribution to journal › Article › peer-review

  6. Weakly Precomplete Equivalence Relations in the Ershov Hierarchy

    Bazhenov, N. A. & Kalmurzaev, B. S., 1 Jul 2019, In: Algebra and Logic. 58, 3, p. 199-213 15 p.

    Research output: Contribution to journal › Article › peer-review

  7. Well-Orders Realized by C.E. Equivalence Relations

    Bazhenov, N. & Zubkov, M., 2022, Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Proceedings. Berger, U., Pauly, A., Franklin, J. N. Y. & Manea, F. (eds.). Springer Science and Business Media Deutschland GmbH, p. 13-23 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13359 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  8. Σ-Definability in Hereditarily Finite Superstructures and Computable Analysis

    Aleksandrova, S. A., 1 Sept 2018, In: Siberian Mathematical Journal. 59, 5, p. 763-767 5 p.

    Research output: Contribution to journal › Article › peer-review

  9. Σ-Preorderings in ℍF (ℝ)

    Morozov, A. S., 1 Nov 2019, In: Algebra and Logic. 58, 5, p. 405-416 12 p.

    Research output: Contribution to journal › Article › peer-review

  10. Компьютерные методы анализа хромосомных контактов в ядре клетки по данным технологий секвенирования

    Orlov, Y. L., Thierry, O., Bogomolov, A. G., Tsukanov, A. V., Kulakova, E. V., Galieva, E. R., Bragin, A. O. & Li, G., Oct 2017, In: Biomeditsinskaya Khimiya. 63, 5, p. 418-422 5 p.

    Research output: Contribution to journal › Article › peer-review

Previous 1...16 17 18 19 20 21 Next

ID: 3082806