deterministic autopoietic automata
Current Language EN
English English Türkçe Türkçe Español Español Português Português Pусский Pусский Filipino Filipino Tiếng Việt Tiếng Việt हिन्दी हिन्दी العربية العربية বাংলা বাংলা Deutsch Deutsch 中文 中文

deterministic autopoietic automata

;Martin Fürer
ama journal of ethics 2009 Vol. 9 pp. 49-53
78
frer2009electronicdeterministic

Abstract

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.

Keywords

computer science mathematicselectronic computers

Access

DOI:
10.4204/EPTCS.9.6
URL:
http://arxiv.org/pdf/0911.2324v1

Citation

ID: 241367
Ref Key: frer2009electronicdeterministic
Use this key to autocite in SciMatic or Thesis Manager

References

References

No Bibliography

Blockchain Verification

Account:
NFT Contract Address:
0x95644003c57E6F55A65596E3D9Eac6813e3566dA
Article ID:
241367
Unique Identifier:
10.4204/EPTCS.9.6
Network:
Scimatic Chain (ID: 481)
Blockchain Readiness Checklist
Authors
Abstract
Journal Name
Year
Title
5/5
Creates 1,000,000 NFT tokens for this article
Token Features:
  • ERC-1155 Standard NFT
  • 1 Million Supply per Article
  • Transferable via MetaMask
  • Permanent Blockchain Record
Blockchain QR Code
Scan with Saymatik Web3.0 Wallet
Gas fees required in SCI Coins
Buy SCI

Saymatik Web3.0 Wallet

Google Play
App Store