2018
DOI: 10.1007/978-3-319-91253-0_37
|View full text |Cite
|
Sign up to set email alerts
|

Observation of Unbounded Novelty in Evolutionary Algorithms is Unknowable

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 38 publications
0
1
0
Order By: Relevance
“…This result has been formalized in search as the "displacement theorem" (Dembski and Marks II 2010). Essentially, this means that teleonomy only provides for bounded or parameterized amounts of novelty, which is in accord with what is known from information theory (Holloway and Marks II 2018). This is backed up by empirical studies of the general capabilities of evolutionary algorithms (Woodward and Bai 2009;Yampolskiy 2018).…”
Section: Teleonomy and Evolutionmentioning
confidence: 80%
“…This result has been formalized in search as the "displacement theorem" (Dembski and Marks II 2010). Essentially, this means that teleonomy only provides for bounded or parameterized amounts of novelty, which is in accord with what is known from information theory (Holloway and Marks II 2018). This is backed up by empirical studies of the general capabilities of evolutionary algorithms (Woodward and Bai 2009;Yampolskiy 2018).…”
Section: Teleonomy and Evolutionmentioning
confidence: 80%