Computation of functions on \(n\) bits by asynchronous clocking of cellular automata (Q272766): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11047-013-9376-7 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q80 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6571382 / rank
 
Normal rank
Property / zbMATH Keywords
 
cellular automaton
Property / zbMATH Keywords: cellular automaton / rank
 
Normal rank
Property / zbMATH Keywords
 
asynchronous
Property / zbMATH Keywords: asynchronous / rank
 
Normal rank
Property / zbMATH Keywords
 
update rule
Property / zbMATH Keywords: update rule / rank
 
Normal rank
Property / zbMATH Keywords
 
universality
Property / zbMATH Keywords: universality / rank
 
Normal rank
Property / zbMATH Keywords
 
temporal order
Property / zbMATH Keywords: temporal order / rank
 
Normal rank
Property / zbMATH Keywords
 
clocking-computable
Property / zbMATH Keywords: clocking-computable / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GAP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11047-013-9376-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089121815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of a theory of computer simulation. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of a theory of simulation. II: Sequential dynamical systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of a theory of simulation. III: Equivalence of SDS. / rank
 
Normal rank
Property / cites work
 
Property / cites work: ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of some conjectures about topological properties of linear cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Issues of Asynchronous CA / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(m\)-asynchronous cellular automata: from fairness to quasi-fairness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully asynchronous behavior of double-quiescent elementary cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Update schedules of sequential dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order Independence in Asynchronous Cellular Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduce-by-Feedback: Timing Resistant and DPA-Aware Modular Multiplication Plus: How to Break RSA by DPA / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11047-013-9376-7 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:07, 9 December 2024

scientific article
Language Label Description Also known as
English
Computation of functions on \(n\) bits by asynchronous clocking of cellular automata
scientific article

    Statements

    Computation of functions on \(n\) bits by asynchronous clocking of cellular automata (English)
    0 references
    0 references
    21 April 2016
    0 references
    cellular automaton
    0 references
    asynchronous
    0 references
    update rule
    0 references
    universality
    0 references
    temporal order
    0 references
    clocking-computable
    0 references

    Identifiers