The following pages link to Sebastiaan A. Terwijn (Q412012):
Displaying 50 items.
- Intuitionistic logic and Muchnik degrees (Q412013) (← links)
- Covering the recursive sets (Q508828) (← links)
- Notes on sum-tests and independence tests (Q633759) (← links)
- Nonapproximability of the normalized information distance (Q716306) (← links)
- The noneffectivity of Arslanov's completeness criterion and related theorems (Q781514) (← links)
- The Medvedev lattice of computably closed sets (Q818514) (← links)
- Intermediate logics and factors of the Medvedev lattice (Q952483) (← links)
- Kripke models, distributive lattices, and Medvedev degrees (Q995672) (← links)
- Genericity and measure for exponential time (Q1350990) (← links)
- Resource bounded randomness and weakly complete problems (Q1392022) (← links)
- Almost complete sets. (Q1426448) (← links)
- The complexity of universal text-learners. (Q1854315) (← links)
- Counting extensional differences in BC-learning (Q1887167) (← links)
- Normalized information distance and the oscillation hierarchy (Q2051851) (← links)
- Partial combinatory algebra and generalized numberings (Q2148902) (← links)
- Fixed point theorems for precomplete numberings (Q2311209) (← links)
- Generalizations of the weak law of the excluded middle (Q2354624) (← links)
- Constructive logic and the Medvedev lattice (Q2505132) (← links)
- On partial randomness (Q2576938) (← links)
- (Q2754021) (← links)
- Computational randomness and lowness (Q2758053) (← links)
- Effective genericity and differentiability (Q2930874) (← links)
- Covering the Recursive Sets (Q3195679) (← links)
- Calibrating Randomness (Q3412463) (← links)
- (Q3418262) (← links)
- On the structure of the Medvedev lattice (Q3503754) (← links)
- (Q3530395) (← links)
- Decidability and Undecidability in Probability Logic (Q3605546) (← links)
- Arithmetical Measure (Q4393174) (← links)
- (Q4436023) (← links)
- (Q4440404) (← links)
- (Q4501552) (← links)
- (Q4525724) (← links)
- (Q4552753) (← links)
- GENERALIZATIONS OF THE RECURSION THEOREM (Q4647121) (← links)
- Computably Enumerable Reals and Uniformly Presentable Ideals (Q4787854) (← links)
- Intuitionistic Logic and Computability Theory (Q4931589) (← links)
- Lowness for the class of random sets (Q4948515) (← links)
- COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS (Q4984865) (← links)
- ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS (Q5015728) (← links)
- The complexity of universal text-learners (Q5055957) (← links)
- Fixpoints and relative precompleteness (Q5075519) (← links)
- Genericity and measure for exponential time (Q5096879) (← links)
- The arithmetical complexity of dimension and randomness (Q5277778) (← links)
- Computer Science Logic (Q5292640) (← links)
- The finite intervals of the Muchnik lattice (Q5390250) (← links)
- MODEL THEORY OF MEASURE SPACES AND PROBABILITY LOGIC (Q5402232) (← links)
- (Q5494240) (← links)
- Probabilistic Logic and Induction (Q5696305) (← links)
- New Computational Paradigms (Q5717080) (← links)
