"Computational Completeness of Networks of Evolutionary Processors with ..."

Rudolf Freund, Vladimir Rogojin, Sergey Verlan (2017)

> Home

Details and statistics

DOI: 10.1007/978-3-319-60252-3_11

access: closed

type: Conference or Workshop Paper

metadata version: 2020-10-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dcfs/FreundRV17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcfs/FreundRV17
Rudolf Freund, Vladimir Rogojin, Sergey Verlan:
Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors. DCFS 2017: 140-151

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.