Algorithmic Irreducibility in a Cellular Automata Universe

Простая страница элемента
dc.creatorChaitin,Gregory
dc.date2005
dc.date.accessioned2024-02-06T12:54:02Z
dc.date.available2024-02-06T12:54:02Z
dc.descriptionWe discuss how to compute the halting probability Omega in the limit in a cellular automata world.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-011-12-1901
dc.identifierhttps://lib.jucs.org/article/28517/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8894
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 11(12): 1901-1903
dc.subjecthalting probability Omega
dc.subjectcellular automaton
dc.titleAlgorithmic Irreducibility in a Cellular Automata Universe
dc.typeResearch Article
Файлы
Коллекции