Yoel Matveyev: Difference between revisions
m shed the red |
Apple Bottom (talk | contribs) We don't need to say "he's notable", that's readily apparent; just list what he did. Also, some links to invite new articles to be written, etc. |
||
| Line 4: | Line 4: | ||
}} | }} | ||
'''Yoel Matveyev''' is a Russian science fiction writer, poet, software developer and a cellular automata enthusiast. In 2021 he released<ref name="post136309" /> the largest known cellular automation computer called Izhora based on his own 4-state rule FireWorld. It has 256 kilobytes of memory, a 256x128 memory-mapped pixel display and a keyboard driven by a script. Its 32-bit CPU uses a single operation, subtract and branch if zero or negative (SUBLEQ), from which all other operations can be synthesized. Examples include 256-bit | '''Yoel Matveyev''' is a Russian science fiction writer, poet, software developer and a cellular automata enthusiast. In 2021 he released<ref name="post136309" /> the largest known cellular automation computer called [[Izhora]] based on his own 4-state rule [[OCA:FireWorld|FireWorld]]. It has 256 kilobytes of memory, a 256x128 memory-mapped pixel display and a keyboard driven by a script. Its 32-bit CPU uses a single operation, subtract and branch if zero or negative (SUBLEQ), from which all other operations can be synthesized. Examples include 256-bit [[factorial]]s, [[prime number|prime]]s and [[Fibonacci number]]s. Tools such as an assembler and emulator are provided for programming it. | ||
Matveyev is also | Matveyev is also proved [[Turing completeness]] of [[OCA:Brian's Brain|Brian's Brain]] in 2020, <ref name="post110762" /> and investigated multistate cyclical rules, which can be viewed as generalizing the notion of [[Self-complementary|self-complementarity]]. In multistate cyclic rules every pattern behaves exactly the same, if the states of all live cells are cyclically changed to one another, e.g. 1→2,2→3,3→1<ref name="post101012" />. | ||
==References== | ==References== | ||
Revision as of 16:11, 29 May 2022
| Yoel Matveyev | |
| Born | Unknown |
|---|---|
| Residence | Unknown |
| Nationality | Russian |
| Institutions | Unknown |
| Alma mater | Unknown |
Yoel Matveyev is a Russian science fiction writer, poet, software developer and a cellular automata enthusiast. In 2021 he released[1] the largest known cellular automation computer called Izhora based on his own 4-state rule FireWorld. It has 256 kilobytes of memory, a 256x128 memory-mapped pixel display and a keyboard driven by a script. Its 32-bit CPU uses a single operation, subtract and branch if zero or negative (SUBLEQ), from which all other operations can be synthesized. Examples include 256-bit factorials, primes and Fibonacci numbers. Tools such as an assembler and emulator are provided for programming it.
Matveyev is also proved Turing completeness of Brian's Brain in 2020, [2] and investigated multistate cyclical rules, which can be viewed as generalizing the notion of self-complementarity. In multistate cyclic rules every pattern behaves exactly the same, if the states of all live cells are cyclically changed to one another, e.g. 1→2,2→3,3→1[3].
References
- ↑ Yoel Matveyev (October 5, 2021). Izhora (Fireworld2 computer) (discussion thread) at the ConwayLife.com forums
- ↑ Yoel Matveyev (November 15, 2020). Re: Turing - complete Generations rules (discussion thread) at the ConwayLife.com forums
- ↑ Yoel Matveyev (July 24, 2020). Re: Gluonic (discussion thread) at the ConwayLife.com forums