11 - 15 out of 15Page size: 10
  1. 2019

  2. Bounded Reducibility for Computable Numberings

    Bazhenov, N., Mustafa, M. & Ospichev, S., 1 Jan 2019, Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Proceedings. Manea, F., Martin, B., Paulusma, D. & Primiero, G. (eds.). Springer, p. 96-107 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11558 LNCS).

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

  3. Friedberg numberings of families of partial computable functionals

    Ospichev, S., 1 Jan 2019, In: Сибирские электронные математические известия. 16, p. 331-339 9 p.

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

  4. 2018

  5. On the complexity of formulas in semantic programming

    Ospichev, S. & Ponomarev, D., 1 Jan 2018, In: Сибирские электронные математические известия. 15, p. 987-995 9 p.

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

  6. 2016

  7. Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings

    Ospichev, S. S., 1 Jun 2016, In: Journal of Mathematical Sciences (United States). 215, 4, p. 529-536 8 p.

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

  8. 2015

  9. Friedberg Numberings in the Ershov Hierarchy

    Ospichev, S. S., Sept 2015, In: Algebra and Logic. 54, 4, p. 283-295 13 p.

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

Previous 1 2 Next

ID: 3440523