T
Tomas Mikolov
Researcher at Facebook
Publications - 94
Citations - 122079
Tomas Mikolov is an academic researcher from Facebook. The author has contributed to research in topics: Language model & Recurrent neural network. The author has an hindex of 49, co-authored 94 publications receiving 104987 citations. Previous affiliations of Tomas Mikolov include Microsoft & Google.
Papers
More filters
Posted Content
Emergence of self-reproducing metabolisms as recursive algorithms in an Artificial Chemistry.
Germán Kruszewski,Tomas Mikolov +1 more
TL;DR: In this paper, the authors present an Artificial Chemistry based on Combinatory Logic, a Turing-complete rewriting system, which relies on a minimal set of possible reactions, and show that a single run of this chemistry starting from a tabula rasa state discovers with no external intervention a wide range of emergent structures, including autopoietic structures that maintain their organisation unchanged, others that grow recursively, and most notably, patterns that reproduce themselves, duplicating their number on each cycle.
Proceedings ArticleDOI
Visualizing computation in large-scale cellular automata
TL;DR: In this paper, the authors propose methods for coarse-graining cellular automata based on frequency analysis of cell states, clustering and autoencoders, which facilitate the discovery of large-scale structure formation and complexity analysis in those systems.
Posted Content
Classification of Discrete Dynamical Systems Based on Transients
Barbora Hudcová,Tomas Mikolov +1 more
TL;DR: In this paper, the authors identify critical regions of behavior that correspond to a phase transition from ordered behavior to chaos across various classes of dynamical systems, such as cellular automata, Turing machines, and random Boolean networks.
Proceedings ArticleDOI
Computational Hierarchy of Elementary Cellular Automata.
Barbora Hudcová,Tomas Mikolov +1 more
TL;DR: In this article, the ability of cellular automata to emulate one another is studied and a set of naturally emerging tasks are defined for parallel computational systems, which are Turing-complete and also computationally efficient.