The following pages link to Paul M. B. Vitányi (Q354146):
Displaying 50 items.
- Tolstoy's mathematics in ``War and peace'' (Q354147) (← links)
- Conditional Kolmogorov complexity and universal probability (Q391323) (← links)
- Identification of probabilities (Q514153) (← links)
- A fast quartet tree heuristic for hierarchical clustering (Q622012) (← links)
- Nonapproximability of the normalized information distance (Q716306) (← links)
- Depth as randomness deficiency (Q733740) (← links)
- A note on the recursive enumerability of some classes of recursively enumerable languages (Q754652) (← links)
- On the power of real-time two-way multihead finite automata with jumps (Q794171) (← links)
- On two-tape real-time computation and queues (Q801685) (← links)
- Time-bounded incompressibility of compressible strings and sequences (Q989573) (← links)
- Sharpening Occam's razor (Q1007542) (← links)
- Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit (Q1064067) (← links)
- An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape (Q1068538) (← links)
- Distributed match-making (Q1107317) (← links)
- Tape versus queue and stacks: The lower bounds (Q1109567) (← links)
- Achievable high scores of \(\varepsilon\)-moves and running times in DPDA computations (Q1143812) (← links)
- How well can a graph be n-colored? (Q1148324) (← links)
- Inductive reasoning and Kolmogorov complexity (Q1190991) (← links)
- Average case complexity under the universal distribution equals worst- case complexity (Q1198047) (← links)
- Optimality of wait-free atomic multiwriter variables (Q1199944) (← links)
- (Q1223938) (redirect page) (← links)
- On a problem in the collective behavior of automata (Q1223939) (← links)
- Deterministic Lindenmayer languages, nonterminals and homomorphisms (Q1228208) (← links)
- On inverse deterministic pushdown transductions (Q1245575) (← links)
- The miraculous universal distribution (Q1272403) (← links)
- Kolmogorov complexity arguments in combinatorics (Q1328399) (← links)
- Erratum to: Kolmogorov complexity arguments in combinatorics (Q1344241) (← links)
- On the simulation of many storage heads by one (Q1348528) (← links)
- Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers (Q1403411) (← links)
- The generalized universal law of generalization. (Q1404969) (← links)
- (Q1575453) (redirect page) (← links)
- A discipline of evolutionary programming (Q1575454) (← links)
- Applying MDL to learn best model granularity (Q1583224) (← links)
- Average-case analysis of algorithms using Kolmogorov complexity (Q1587331) (← links)
- Obituary: Ray Solomonoff, founding father of algorithmic information theory (Q1662560) (← links)
- (Q1676322) (redirect page) (← links)
- On the rate of decrease in logical depth (Q1676323) (← links)
- Corrigendum to: ``On the rate of decrease in logical depth'' by by L. F. Antunes, A. Souto, and P. M. B. Vitányi (Q1740700) (← links)
- New applications of the incompressibility method. II (Q1978700) (← links)
- `Ideal learning' of natural language: positive results about learning from positive evidence (Q2382634) (← links)
- Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines (Q2420575) (← links)
- Sexually reproducing cellular automata (Q2561202) (← links)
- Individual communication complexity (Q2643018) (← links)
- Time and space bounds for reversible simulation (Q2766195) (← links)
- (Q2766868) (← links)
- Two heads are better than two tapes (Q2817660) (← links)
- Optimal routing tables (Q2942725) (← links)
- A lower bound on the average-case complexity of shellsort (Q2946997) (← links)
- Similarity and denoising (Q2955479) (← links)
- (Q3051375) (← links)
