Learning the Undecidable from Networked Systems

DOI10.1142/9789811200076_0009MaRDI QIDQ4993065zbMATH OpenOpenAlexFDO

Authors Felipe S. Abrahão, Itala D'Ottaviano, Klaus Wehmuth, Francisco Antonio Doria, Artur Ziviani

Publication date 15 June 2021

Published in Unravelling Complexity (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.07027

Mathematics Subject Classification ID

History and biography (01-XX) Computer science (68-XX)

Recommendations

• Algorithmic networks: central time to trigger expected emergent open-endedness
• Emergent Open-Endedness from Contagion of the Fittest
• scientific article; zbMATH DE number 1900795
• Algorithmic complexity as a criterion of unsolvability
• Abelian networks. II: Halting on all inputs

Cited in

(2)

• Undecidability in decentralized supervision
• Learning the undecidable from networked systems

This page was built for publication: Learning the Undecidable from Networked Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993065)