Computability
| 短名 | |
| Journal Impact | 0.28 |
| 国际分区 | MATHEMATICS, APPLIED(Q4) |
| ISSN | 2211-3568, 2211-3576 |
| h-index | 12 |
| 涉及主题 | 数学计算机科学离散数学组合数学纯数学算法程序设计语言数学分析理论计算机科学哲学物理生物 |
| 出版信息 | 出版商: IOS Press BV，出版周期: ，期刊类型: journal |
| 基本数据 | 创刊年份: 2012，原创研究文献占比: 100.00%，自引率:0.00%， Gold OA占比: 0.00% |
期刊引文格式
这些示例是对学术期刊文章的引用，以及它们应该如何出现在您的参考文献中。
并非所有期刊都按卷和期组织其已发表的文章，因此这些字段是可选的。有些电子期刊不提供页面范围，而是列出文章标识符。在这种情况下，使用文章标识符而不是页面范围是安全的。
只有1位作者的期刊
有2位作者的期刊
有3位作者的期刊
有5位以上作者的期刊
书籍引用格式
以下是创作和编辑的书籍的参考文献的示例。
学位论文引用格式
网页引用格式
这些示例是对网页的引用，以及它们应该如何出现在您的参考文献中。
专利引用格式
最新文章
Hilbert’s tenth problem for term algebras with a substitution operator
2024-9-11
Solovay reducibility via Lipschitz functions and signed-digit representation
2024-6-27
Interplay between insertion of zeros and the complexity of Dedekind cuts
2024-6-13
Computability and non-monotone induction
2024-6-13
The Point-to-Set Principle and the dimensions of Hamel bases
2024-6-13
Defining long words succinctly in FO and MSO
2024-6-12
Reifying dynamical algebra: Maximal ideals in countable rings, constructively
2024-4-26
On the Weihrauch degree of the additive Ramsey theorem
2024-4-23
Weihrauch degrees without roots
2024-4-12
Choice principles characterizing the difference between König’s lemma and weak König’s lemma in constructive reverse mathematics
2024-4-2
Enumerations of families closed under finite differences
2024-3-20
Nearly computable real numbers
2024-3-20
Lowness properties for strong reducibilities and the computational power of maximal sets
2024-3-20
Lower bounds on β ( α ) and other properties of α-register machines
2024-3-6
Computing the index of non-isometric k-ary words with Hamming and Lee distance
2024-3-1
Complemented subsets and Boolean-valued, partial functions
2024-2-14
On the first-order parts of problems in the Weihrauch degrees
2024-1-31
Ideal presentations and numberings of some classes of effective quasi-Polish spaces
2024-1-29
Exploring the abyss in Kleene’s computability theory
2024-1-23
Preface
2023-12-21
How much partiality is needed for a theory of computability?
2023-12-21
Inversion operations in algebraic structures
2023-12-21
On the main scientific achievements of Victor Selivanov
2023-12-21
Approximating Kolmogorov complexity
2023-11-13
Banach’s theorem in higher-order reverse mathematics
2023-11-13
Enumerations of families closed under finite differences
2023-10-27
Notes on overt choice
2023-10-10
Strong computable type
2023-9-22
Algorithmically random series
2023-9-13
Effectively infinite classes of numberings and computable families of reals
2023-8-29
Numberings, c.e. oracles, and fixed points
2023-8-29
Punctually presented structures I: Closure theorems
2023-8-29
Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines
2023-6-21
Limit computability and ultrafilters
2023-6-21
L 2 -Betti numbers and computability of reals
2023-6-21
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
2023-3-14
Characterizing time computational complexity classes with polynomial differential equations
2023-1-19
Primitive recursive ordered fields and some applications
2023-1-19
Randomness extraction in computability theory
2023-1-19
Evitable iterates of the consistency operator
2023-1-19
Effective aspects of Hausdorff and Fourier dimension
2022-12-21
Generically and coarsely computable isomorphisms
2022-12-21
Primitive recursive equivalence relations and their primitive recursive complexity
2022-12-21
Inequalities for space-bounded Kolmogorov complexity
2022-12-21
Preface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021
2022-12-21
Extending properly n - REA sets1
2022-12-21
Non-collapse of the effective Wadge hierarchy
2022-12-9
Primitive recursive ordered fields and some applications
2022-12-9
Randomness extraction in computability theory
2022-9-6
Extensions of two constructions of Ahmad
2022-5-20
帮你贴心管理全部的文献
研飞ivySCI，高效的论文管理
投稿经验分享
分享我的经验，帮你走得更远