About: Autopoietic Automata: Complexity Issues in Offspring-Producing Evolving Processes

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Autopoietic Automata: Complexity Issues in Offspring-Producing Evolving Processes Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	We introduce a new formal computational model designed for studying the information transfer among the generations of offspring-producing evolving machines so-called autopoietic automata. These can be seen as nondeterministic finite state transducers whose %22program%22 can become a subject of their own processing. An autopoietic automaton can algorithmically generate an offspring controlled by a program which is a modification of its parent’s program. Autopoietic automata offer a neat framework for investigating computational and complexity issues in the evolutionary self-reproducing processes. We show that the computational power of lineages of autopoietic automata is equal to that of an interactive nondeterministic Turing machine. We also prove that there exists an autopoietic automaton giving rise to an unlimited evolution, provided that suitable inputs are delivered to individual automata. However, the problem of sustainable evolution, asking whether for an arbitrary autopoietic autom We introduce a new formal computational model designed for studying the information transfer among the generations of offspring-producing evolving machines so-called autopoietic automata. These can be seen as nondeterministic finite state transducers whose %22program%22 can become a subject of their own processing. An autopoietic automaton can algorithmically generate an offspring controlled by a program which is a modification of its parent’s program. Autopoietic automata offer a neat framework for investigating computational and complexity issues in the evolutionary self-reproducing processes. We show that the computational power of lineages of autopoietic automata is equal to that of an interactive nondeterministic Turing machine. We also prove that there exists an autopoietic automaton giving rise to an unlimited evolution, provided that suitable inputs are delivered to individual automata. However, the problem of sustainable evolution, asking whether for an arbitrary autopoietic autom (en) Navrhujeme tzv. autopoietické automaty, které představují nový výpočetní model vhodný pro studium přenosu genetické informace v potomstvu evolučních zařízení. Autopoietické automaty poskytují vhodný rámec pro studium výpočetních a složitostních aspektů evolučních sebereprodukujících se procesů. (cs)
Title	Autopoietic Automata: Complexity Issues in Offspring-Producing Evolving Processes Autopoietické automaty: složitostní aspekty evolučních sebereprodukčních procesů. (cs) Autopoietic Automata: Complexity Issues in Offspring-Producing Evolving Processes (en)
skos:prefLabel	Autopoietic Automata: Complexity Issues in Offspring-Producing Evolving Processes Autopoietické automaty: složitostní aspekty evolučních sebereprodukčních procesů. (cs) Autopoietic Automata: Complexity Issues in Offspring-Producing Evolving Processes (en)
skos:notation	RIV/67985807:_____/07:00085028!RIV08-AV0-67985807
http://linked.open.../vavai/riv/strany	260;269
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1ET100300517), Z(AV0Z10300504)
http://linked.open...iv/cisloPeriodika	2-3
http://linked.open...vai/riv/dodaniDat	2008
http://linked.open...aciTvurceVysledku	Wiedermann, Jiří
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Ústav informatiky AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	411197
http://linked.open...ai/riv/idVysledku	RIV/67985807:_____/07:00085028
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	autopoietic automata; self-reproducing automata; interactive Turing machine; simulation; computational complexity (en)
http://linked.open.../riv/klicoveSlovo	computational complexity simulation self-reproducing automata autopoietic automata interactive Turing machine
http://linked.open...odStatuVydavatele	NL - Nizozemsko
http://linked.open...ontrolniKodProRIV	[B9F142AA02A1]
http://linked.open...i/riv/nazevZdroje	Theoretical Computer Science
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	Methods for Intelligent Systems and Their Applications in Datamining and Natural Language Processing
http://linked.open...UplatneniVysledku	2007
http://linked.open...v/svazekPeriodika	383
http://linked.open...iv/tvurceVysledku	Wiedermann, Jiří
http://linked.open...n/vavai/riv/zamer	Informatika pro informační společnost: modely, algoritmy, aplikace
issn	0304-3975
number of pages	10 (xsd:int)
is http://linked.open...avai/riv/vysledek of	Autopoietic Automata: Complexity Issues in Offspring-Producing Evolving Processes Autopoietic Automata: Complexity Issues in Offspring-Producing Evolving Processes Autopoietic Automata: Complexity Issues in Offspring-Producing Evolving Processes

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 41 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software