EUVIMED · CrossrefZeitschrift
Computability
ISSN 2211-3568 · SAGE Publications
Neueste Artikel
A generalization of Markov’s approach to the continuity problem for Type 1 computable functions
Type-2 feedback computability
Punctual dimension and the punctual degrees of discrete linear orderings
Elementarity of subgroups and complexity of theories for profinite groups
On ordinals realized by c.e. equivalence relations
From the Lyndon factorization to the canonical inverse Lyndon factorization: Back and forth
Real closed fields via strong Solovay reducibility
Cross-constraint basis theorems and products of partitions
New definitions in the theory of Type 1 computable topological spaces
The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility
On the transversals of a ceer
Reverse mathematics of a color basis theorem
A jump operator on the Weihrauch degrees
Set descriptive complexity of solvable functions
Forcing as a computational process
There is no composition in the [strong] computable reducibility degrees
On the computational properties of the Baire category theorem
Complexity issues for the iterated h-preorders
Infinite Eulerian paths are computable on graphs with vertices of infinite degree
Universal Boolean algebras, their ideals, and applications to semantic classes of models
Avoiding the subrecursive cone of Cauchy sequences
Effective subfactor theory
Degree structures of hyperspaces over unusual ground types
The strange world of transfinite melodies—Recognizability for weak and strong infinite time α-register machines
On the Strength of Weak Compactness
Constant Compression and Random Weights
Incomputability of Simply Connected Planar Continua
Computably Enumerable Partial Orders
Incompleteness, Approximation and Relative Randomness
Author Index Volume 1 (2012)
EUVIMED