Keywords: 03D10; 03D32; 03E15; 03E45; Infinite time Turing machines; Algorithmic randomness; Effective descriptive set theory; Woodin cardinals; Inner models;
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: primary; 03D32; secondary; 68Q30; 03D28; K-trivial sets; Algorithmic randomness;
Keywords: 03D32; 68Q30; 03D30; 03D80; Computability theory; Coarse computability; Gamma question;
Keywords: 03D28; 03D32; Recursion theory; Algorithmic randomness; Schnorr trvivial sets; Diagonally nonrecursive (DNR) sets; Infinitely often subuniform families of sets; Sets of hyperimmune-free degree;
Keywords: 03D32; Computable measures; Random sequences; Complex sequences; Atomic measures; Trivial measures; Diminutive measures;
Keywords: primary; 03D32; secondary; 03D28; 68Q30; 03H15; Kolmogorov complexity; Partial randomness; Effective Hausdorff dimension; Martin-Löf randomness; Models of arithmetic;
Keywords: primary; 03D32; 03F99; 68Q30; secondary; 03F20; Probabilistic proofs; Kolmogorov complexity; Martin-Löf randomness;
Keywords: 03D32; 03D30; 03F60; 03D80; Strong measure zero; Martingale; Muchnik degree; Algorithmic probability; Kolmogorov complexity; Computable traceability;
Keywords: 03D32; 68Q30; 03D30; 03F60Universal Martin-Löf test; Optimal Martin-Löf test; Randomness deficiency; Layerwise computability; Weihrauch degrees
Keywords: 68Q30; 03D32; 28A80; 03D78Effective dimension; Random self-similar fractal; Dimension spectra
On constructivity and the Rosser property: a closer look at some Gödelean proofs
Keywords: 03F40; 03F30; 03D32; 68Q30; Constructive proof; Rosser Property; Incompleteness; Kleene's proof; Chaitin's proof; Boolos' proof;
Martin-Löf random generalized Poisson processes
Keywords: primary; 03D32; secondary; 03F60; 60D99; 68Q30; Algorithmic randomness; Martin-Löf randomness; Random closed sets;
Generics for computable Mathias forcing
Keywords: 03D80; 03E40; 03D32; 03E75; Effective forcing; Mathias forcing; Computability theory;
Kolmogorov complexity and computably enumerable sets
Keywords: 03D30; 03D80; 03D32; Computably enumerable sets; Kolmogorov complexity; Relativization;
Decidable lim sup and Borel–Cantelli-like lemmas for random sequences
Keywords: 03D32; 60A05; 60F10; 68Q30; 60G50Algorithmically random sequence; Layerwise decidable; Effective Borel–Cantelli lemmas; Kolmogorov complexity; Compressibility coefficient
Constraints placed on random sequences by their compressibility
Keywords: 03D32; 60A05; 60F10; 68Q30; 60G50Algorithmically random sequence; Compressibility; Probability laws; Large deviations
Tracing and domination in the Turing degrees
Keywords: 03D30; 03D32; 03D25; 03D28Turing degrees; Tracing; Domination; Array computability
Characterizing strong randomness via Martin-Löf randomness
Keywords: 03D32; 68Q30; 03D30Randomness; Kolmogorov complexity
Extracting information is hard: A Turing degree of non-integral effective Hausdorff dimension
Keywords: primary; 03D32; secondary; 68Q30; 28A78; Effective Hausdorff dimension; Turing degrees;
Oscillation in the initial segment complexity of random reals
Keywords: primary; 03D32; secondary; 68Q30; 03D30; 03E35; Kolmogorov complexity; Initial segment complexity; Effective randomness;
Some theorems on the algorithmic approach to probability theory and information theory
Keywords: 68Q30; 03D32; 94A15; 60A05; Kolmogorov complexity; Information; Randomness; Entropy; Algorithm;