The following pages link to Rūsiņš Freivalds (Q656589):
Displaying 41 items.
- (Q198418) (redirect page) (← links)
- A new family of nonstochastic languages (Q656590) (← links)
- On the power of probabilistic strategies in inductive inference (Q760795) (← links)
- On block pumpable languages (Q897892) (← links)
- Quantum inductive inference by finite automata (Q924168) (← links)
- Learning with belief levels (Q927871) (← links)
- Improved constructions of mixed state quantum automata (Q1017405) (← links)
- On the relative sizes of learnable sets (Q1128667) (← links)
- Language recognition using finite probabilistic multitape and multihead automata (Q1147521) (← links)
- Language recognition using probabilistic Turing machines in real time, and automata with a push-down store (Q1147522) (← links)
- (Q1167541) (redirect page) (← links)
- Projections of languages recognizable by probabilistic and alternating finite multitape automata (Q1167542) (← links)
- On the power of inductive inference from good examples (Q1210543) (← links)
- Identifying nearly minimal Gödel numbers from additional information (Q1273763) (← links)
- On the inductive inference of recursive real-valued functions (Q1292395) (← links)
- On the role of procrastination in machine learning (Q1317427) (← links)
- Kolmogorov numberings and minimal identification (Q1389656) (← links)
- Quantum computation with write-only memory (Q1761714) (← links)
- On duality in learning and the selection of learning teams (Q1817221) (← links)
- Trade-off among parameters affecting inductive inference (Q1823012) (← links)
- Learning by the process of elimination (Q1854541) (← links)
- How inductive inference strategies discover their errors (Q1892886) (← links)
- Amount of nonconstructivity in deterministic finite automata (Q1959651) (← links)
- On the intrinsic complexity of learning (Q2508338) (← links)
- Choosing a learning team (Q2817619) (← links)
- Algorithmic Information Theory and Computational Complexity (Q2868411) (← links)
- Hartmanis-Stearns Conjecture on Real Time and Transcendence (Q2891306) (← links)
- Multiple Usage of Random Bits in Finite Automata (Q2898066) (← links)
- Active Learning of Recursive Functions by Ultrametric Algorithms (Q2938104) (← links)
- Ultrametric Algorithms and Automata (Q2945554) (← links)
- Structured Frequency Algorithms (Q2948453) (← links)
- On the Amount of Nonconstructivity in Learning Recursive Functions (Q3010414) (← links)
- (Q3021291) (← links)
- (Q3044341) (← links)
- (Q3142563) (← links)
- (Q3222174) (← links)
- (Q3319779) (← links)
- (Q3326840) (← links)
- Inductive Inference and Computable One‐One Numberings (Q3328535) (← links)
- (Q3341907) (← links)
- CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS (Q3347868) (← links)
