default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputability, Volume 12
Volume 12, Number 1, 2023
- Douglas Cenzer, Christopher P. Porter:
Randomness extraction in computability theory. 1-21 - Riccardo Gozzi, Daniel Graça
:
Characterizing time computational complexity classes with polynomial differential equations. 23-57 - James Walsh:
Evitable iterates of the consistency operator. 59-69 - Victor L. Selivanov, Svetlana Selivanova:
Primitive recursive ordered fields and some applications. 71-99
Volume 12, Number 2, 2023
- Uri Andrews, Mingzhong Cai, David Diamondstone, Noah Schweber:
Limit computability and ultrafilters. 101-115 - Daniel Silva Graça, Ning Zhong:
Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines. 117-144 - Eric Allender, Nikhil Balaji, Samir Datta, Rameshwar Pratap:
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs. 145-173 - Clara Löh, Matthias Uschold:
L2-Betti numbers and computability of reals. 175-201
Volume 12, Number 3, 2023
- Jeffry L. Hirst, Carl Mummert:
Banach's theorem in higher-order reverse mathematics. 203-225 - Djamel Eddine Amir, Mathieu Hoyrup:
Strong computable type. 227-269 - Marat Kh. Faizrahmanov:
Numberings, c.e. oracles, and fixed points. 271-282 - Ruslan Ishkuvatov, Daniil Musatov, Alexander Shen:
Approximating Kolmogorov complexity. 283-297
Volume 12, Number 4, 2023
- Nikolay Bazhenov, Takayuki Kihara, Svetlana Selivanova:
Preface. 299 - Nikolay Bazhenov, Takayuki Kihara, Svetlana Selivanova, Dieter Spreen:
On the main scientific achievements of Victor Selivanov. 301-314 - Pavel Alaev:
Inversion operations in algebraic structures. 315-322 - Marina Dorzhieva, Alexander G. Melnikov:
Punctually presented structures I: Closure theorems. 323-337 - Marat Kh. Faizrahmanov, Zlata Shchedrikova:
Effectively infinite classes of numberings and computable families of reals. 339-350 - Mathieu Hoyrup:
Notes on overt choice. 351-369 - Dieter Spreen:
How much partiality is needed for a theory of computability? 371-426
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-29 01:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
