Periodicity in generations of automata
From MaRDI portal
Publication:4047534
Cites work
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3307591 (Why is no real title available?)
- scientific article; zbMATH DE number 3363435 (Why is no real title available?)
- scientific article; zbMATH DE number 3189698 (Why is no real title available?)
- A Note on Degrees of Self-Describing Turing Machines
- A note on some systems of lindenmayer
- Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation
- Sexually reproducing cellular automata
- The chemical basis of morphogenesis
Cited in
(52)- Learning and classifying
- Parallelism Increases Iterative Learning Power
- Kolmogorov numberings and minimal identification
- Costs of general purpose learning
- Program self-reference in constructive Scott subdomains
- Learning languages from positive data and a finite number of queries
- Reflecting and self-confident inductive inference machines
- Machine learning of higher-order programs
- Iterative learning from texts and counterexamples using additional information
- The structure of intrinsic complexity of learning
- The synthesis of language learners.
- Learning languages in the limit from positive information with finitely many memory changes
- Learning-theoretic perspectives of acceptable numberings
- On the power of recursive optimizers
- Computability-theoretic learning complexity
- Parsimony hierarchies for inductive inference
- The independence of control structures in abstract programming systems
- Infinitary self-reference in learning theory
- Dynamically Delayed Postdictive Completeness and Consistency in Learning
- Effectivity questions for Kleene's recursion theorem
- From Turing machines to computer viruses
- A solution to Wiehagen's thesis
- An invariance notion in recursion theory
- Secretive interaction. Players and strategies
- A map of update constraints in inductive inference
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
- Learning secrets interactively. Dynamic modeling in inductive inference
- On the amount of nonconstructivity in learning formal languages from text
- scientific article; zbMATH DE number 605140 (Why is no real title available?)
- Strongly non-U-shaped language learning results by general techniques
- The complexity of index sets of classes of computably enumerable equivalence relations
- Iterative learning from positive data and counters
- Robust learning -- rich and poor
- Learnability: admissible, co-finite, and hypersimple languages
- Dynamic Modeling in Inductive Inference
- Comparison of identification criteria for machine inductive inference
- Universal computably enumerable equivalence relations
- Towards a map for incremental learning in the limit from positive and negative information
- Synthesizing noise-tolerant language learners
- Synthesizing learners tolerating computable noisy data
- Parallelism increases iterative learning power
- Mapping monotonic restrictions in inductive inference
- Jumps of computably enumerable equivalence relations
- On aggregating teams of learning machines
- On the inference of approximate programs
- One-sided error probabilistic inductive inference and reliable frequency identification
- Trade-off among parameters affecting inductive inference
- Robust behaviorally correct learning.
- On learning of functions refutably.
- Learning in the presence of inaccurate information
- On a question about learning nearly minimal programs
- Incremental concept learning for bounded data mining.
This page was built for publication: Periodicity in generations of automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4047534)
