Keywords: primary; 03D30; secondary; 03D80; 05C69; 37B10; Good approximations; Enumeration degrees; Density; Cototal enumeration degrees;
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: 03D25; 03D30; 03D45; 03F15; Computably enumerable equivalence relation; Computable reducibility on equivalence relations; Halting jump;
Keywords: 03D32; 68Q30; 03D30; 03D80; Computability theory; Coarse computability; Gamma question;
Keywords: 03D25; 03D30; (Uniformly) non-low2; Computable Lipschitz reducibility; Common upper bound;
Keywords: 03D20; 03D30; 03F30; 03G10; Sub-recursive hierarchies; Honest elementary degrees; Degrees of relative provability;
Keywords: 03D80; 03B30; 03D30; 05D10; Computability theory; Effective combinatorics; Weihrauch reducibility; Reverse mathematics;
Keywords: 03D32; 03D30; 03F60; 03D80; Strong measure zero; Martingale; Muchnik degree; Algorithmic probability; Kolmogorov complexity; Computable traceability;
Keywords: 03D30; 03D28; 03E75; 03F35Enumeration reducibility; First order definability; Automorphism group; Coding
Keywords: 03D25; 03D28; 03D30; 03D60Computably enumerable degrees; Π10 classes; Thin Π10 classes; Cantor–Bendixson ranks
Keywords: 03D28; 03D30; 03D45; O3C57Computable structure theory; Jump degree; Turing ordinal; Back-and-forth relation; Linear orderings
Keywords: 03D32; 68Q30; 03D30; 03F60Universal Martin-Löf test; Optimal Martin-Löf test; Randomness deficiency; Layerwise computability; Weihrauch degrees
Keywords: 03D30; 03E15; 26A21; 68Q32Π10 class; Medvedev degree; Borel measurable function; Countable continuity
Keywords: 03D30; 03D78; 03F60; 03E15; 03B55; 68Q32Computable analysis; Limit computable mathematics; Identification in the limit; Medvedev degree; Weihrauch degree
Addendum to: “The Bolzano-Weierstrass theorem is the jump of weak KÅnig's lemma” [Ann. Pure Appl. Logic 163 (6) (2012) 623-655]
Keywords: 03F60; 03D30; 03B30; 03E15;
The Ï-Turing degrees
Keywords: 03D28; 03D55; 03D99; 03D30; Turing reducibility; Ï-Enumeration degrees; Degrees structures;
Avoiding uniformity in the Î20 enumeration degrees
Keywords: 03D30; 03D55; 03D15; 03D25; Enumeration reducibility; Degree; Ershov Hierarchy; Incomparable degree; Arithmetical uniformity; Low; High; Cappable;
Graphs realised by r.e. equivalence relations
Keywords: 03D25; 03D30; 03D45; 03D50; Recursively enumerable equivalence relation; Recursively enumerable structure; m-reducibility; C-reducibility;
Natural factors of the Muchnik lattice capturing IPC
Keywords: 03D30; 03B20; 03G10; 06D20; Muchnik degrees; Intuitionistic logic; Kripke models;
Kolmogorov complexity and computably enumerable sets
Keywords: 03D30; 03D80; 03D32; Computably enumerable sets; Kolmogorov complexity; Relativization;
Tracing and domination in the Turing degrees
Keywords: 03D30; 03D32; 03D25; 03D28Turing degrees; Tracing; Domination; Array computability
On n-tardy sets
Keywords: 03D25; 03D30; c.e. sets; r.e. sets; Automorphisms; n-tardy sets;
Oscillation in the initial segment complexity of random reals
Keywords: primary; 03D32; secondary; 68Q30; 03D30; 03E35; Kolmogorov complexity; Initial segment complexity; Effective randomness;