๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On a class of automata models of learning machines

โœ Scribed by G. Langholz

Publisher
Elsevier Science
Year
1972
Weight
311 KB
Volume
4
Category
Article
ISSN
0020-7373

No coin nor oath required. For personal study only.

โœฆ Synopsis

A class of machines modelled as deterministic Moore automata is proposed.

Particular attention is given to investigating their capability of exhibiting learning behaviour assessed by an associated index of performance. This is done by assuming that the automata are operating in a random environment about which they have no a priori knowledge.

๐Ÿ“œ SIMILAR VOLUMES

A class of linear automata on graphs
A class of linear automata on graphs
โœ A. G. Rutkas; D. M. Chausovskii ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Springer US ๐ŸŒ English โš– 406 KB
A class of semisimple automata
A class of semisimple automata
โœ Kelarev, A. V. ;Sokratova, O. V. ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 127 KB
A new class of automata networks
A new class of automata networks
โœ Nino Boccara; Henryk Fukล›; Servie Geurten ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 452 KB

A new class of automata networks is defined. Their evolution rules are determined by a probability measure p on the set of all integers 7/and an indicator function IA on the interval [0, 1]. It is shown that any cellular automaton rule can be represented b3 a (nonunique) rule formulated in terms of