scientific article
From MaRDI portal
Publication:3758821
zbMath0622.03031MaRDI QIDQ3758821
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
First-order arithmetic and fragments (03F30) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees ⋮ Computability of convergence rates in the ergodic theorem for Martin-Löf random points ⋮ On the uniform computational content of the Baire category theorem ⋮ Randomness, Computation and Mathematics ⋮ Initial segment complexities of randomness notions ⋮ Low for random reals and positive-measure domination ⋮ DEGREES OF RANDOMIZED COMPUTABILITY ⋮ Cupping with random sets ⋮ Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers ⋮ Randomness and the linear degrees of computability ⋮ Gacs-Kucera theorem ⋮ An improved zero-one law for algorithmically random sequences ⋮ Optimal redundancy in computations from random oracles ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ Continuous randomness via transformations of 2-random sequences ⋮ Ramsey-type graph coloring and diagonal non-computability ⋮ Characterizing strong randomness via Martin-Löf randomness ⋮ RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ The Kučera-Gács theorem revisited by Levin ⋮ On initial segment complexity and degrees of randomness ⋮ A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points ⋮ HIGHER RANDOMNESS AND GENERICITY ⋮ Computing from projections of random points ⋮ FORCING WITH BUSHY TREES ⋮ Growth and irreducibility in path-incompressible trees ⋮ Oscillation in the initial segment complexity of random reals ⋮ Demuth randomness and computational complexity ⋮ Feasible reductions to Kolmogorov-Loveland stochastic sequences ⋮ Characterizing the strongly jump-traceable sets via randomness ⋮ ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY ⋮ A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals ⋮ Array nonrecursiveness and relative recursive enumerability ⋮ Some logically weak Ramseyan theorems ⋮ The Information Content of Typical Reals ⋮ Solovay functions and their applications in algorithmic randomness ⋮ On the logical strengths of partial solutions to mathematical problems ⋮ Bi-immunity over different size alphabets ⋮ Where pigeonhole principles meet Koenig lemmas ⋮ On the algebraic structure of Weihrauch degrees ⋮ Diagonally non-computable functions and fireworks ⋮ Two more characterizations of \(K\)-triviality ⋮ Effectively closed sets of measures and randomness ⋮ On relative randomness ⋮ Schnorr Randomness ⋮ Strong reductions in effective randomness ⋮ Schnorr Trivial Reals: A construction ⋮ RECOGNIZING STRONG RANDOM REALS ⋮ Joining up to the generalized high degrees ⋮ On low for speed oracles ⋮ Algorithmic randomness, reverse mathematics, and the dominated convergence theorem ⋮ Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees ⋮ On the degree spectrum of a $\Pi ^0_1$ class ⋮ Uniform van Lambalgen's theorem fails for computable randomness ⋮ Highness properties close to PA completeness ⋮ BEING LOW ALONG A SEQUENCE AND ELSEWHERE ⋮ Randomness and lowness notions via open covers ⋮ Mass problems associated with effectively closed sets ⋮ On the computability of perfect subsets of sets with positive measure ⋮ Spectra of theories and structures ⋮ Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets ⋮ A note on the join property ⋮ Martin-Löf randomness implies multiple recurrence in effectively closed sets ⋮ Measures and their random reals ⋮ Non-cupping and randomness ⋮ Continuous higher randomness ⋮ Randomness below complete theories of arithmetic ⋮ Integer valued betting strategies and Turing degrees ⋮ Schnorr triviality and its equivalent notions ⋮ A Church-Turing thesis for randomness?
This page was built for publication:
