All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Classification of Discrete Dynamical Systems Based on Transients

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3A10454753" target="_blank" >RIV/00216208:11320/22:10454753 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21730/22:00354745

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=V354XClsMR" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=V354XClsMR</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1162/artl_a_00342" target="_blank" >10.1162/artl_a_00342</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Classification of Discrete Dynamical Systems Based on Transients

  • Original language description

    In order to develop systems capable of artificial evolution, we need to identify which systems can produce complex behavior. We present a novel classification method applicable to any class of deterministic discrete space and time dynamical systems. The method is based on classifying the asymptotic behavior of the average computation time in a given system before entering a loop. We were able to identify a critical region of behavior that corresponds to a phase transition from ordered behavior to chaos across various classes of dynamical systems. To show that our approach can be applied to many different computational systems, we demonstrate the results of classifying cellular automata, Turing machines, and random Boolean networks. Further, we use this method to classify 2D cellular automata to automatically find those with interesting, complex dynamics. We believe that our work can be used to design systems in which complex structures emerge. Also, it can be used to compare various versions of existing attempts to model open-ended evolution (Channon, 2006; Ofria &amp; Wilke, 2004; Ray, 1991).

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10101 - Pure mathematics

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Artificial Life

  • ISSN

    1064-5462

  • e-ISSN

    1530-9185

  • Volume of the periodical

    2021

  • Issue of the periodical within the volume

    27

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    26

  • Pages from-to

    220-245

  • UT code for WoS article

    000817324700006

  • EID of the result in the Scopus database

    2-s2.0-85127117317