Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection
For ¥0.57 per day, unlimited downloads CREATE MEMBERSHIP Download

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

Computation in reversible cellular automata

Author:
Morita, Kenichi  


Journal:
INTERNATIONAL JOURNAL OF GENERAL SYSTEMS


Issue Date:
2012


Abstract(summary):

A reversible cellular automaton (RCA) is a subclass of a CA such that its global function is injective. It is considered as an abstract spatiotemporal model of a reversible physical system. In spite of the strong constraint of reversibility, an RCA has a high ability of information processing. In this survey, we overview the past studies on RCAs, and discuss how computing is performed in them. We can see even very simple RCAs have computation-universality.


Page:
569---581


VIEW PDF

The preview is over

If you wish to continue, please create your membership or download this.

Create Membership

Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads