Computing with planar toppling domino arrangements (Q256439): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W600256 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2784236 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Conservative logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: SAND PILE AS A UNIVERSAL COMPUTER / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Majority-vote cellular automata, Ising dynamics, and \(\mathbf P\)-completeness / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:04, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing with planar toppling domino arrangements |
scientific article |
Statements
Computing with planar toppling domino arrangements (English)
0 references
9 March 2016
0 references
domino logic
0 references
dual-rail logic
0 references
excitable media
0 references
one-shot logic
0 references