Deterministic Autopoietic Automata

Computer Science – Neural and Evolutionary Computing

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.4204/EPTCS.9.6

This paper studies two issues related to the paper on Computing by
Self-reproduction: Autopoietic Automata by Jiri Wiedermann. It is shown that
all results presented there extend to deterministic computations. In
particular, nondeterminism is not needed for a lineage to generate all
autopoietic automata.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Deterministic Autopoietic Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deterministic Autopoietic Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic Autopoietic Automata will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-150268

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.