Ultimate question discussion about ultimate-question HOT 14 OPEN

Other discussions:

• physics.stackexchange.com, backup (2016)
• math.stackexchange.com (2016)
• biology.stackexchange.com (2016)
• from emails (2018)
• reddit.com/r/oee/comments/97q529 (2018)
• reddit.com/r/evolution/comments/97s3ma (2018)
• reddit.com/r/alife/comments/9hdqzp (2018)

from ultimate-question.

(Update 2)

7. Artificial life model as a self-justifying theory of everything
7.3 Help needed to solve the question: What is the inanimate matter? (and why these laws?)

from ultimate-question.

New speculations about "What is the inanimate matter?" in a model where life and natural selection are basic: kiwi0fruit.github.io/ultimate-question/#s7_3

from ultimate-question.

Complete rewrite of article introduction: kiwi0fruit.github.io/ultimate-question.

from ultimate-question.

Addition: Intro pt.5: Obvious problems, incl. what is inanimate matter? what about quantum computers? kiwi0fruit.github.io/ultimate-question/#i5

from ultimate-question.

Open-endedness as Turing completeness analogue for population of self organizing algorithms

from ultimate-question.

Open-ended natural selection of interacting code-data-dual algorithms as a property analogous to Turing completeness

Main reddit discussion (contain copies from other sources as well) - lots of comments:

reddit.com/r/DigitalPhilosophy, backup (2019)

from ultimate-question.

Do you see a way to use abstract rewriting system over graphs from Wolfram Physics Project to represent code-data dual algothms that modify each other and form natural selection process?

Article Some Relativistic and Gravitational Properties of the Wolfram
Model (by Jonathan Gorard - 2020) has interesting definition of abstract rewriting systems that work on graphs.

Do you see a way to use them to represent code-data dual algorithms that modify each other and form natural selection process? That could be a nice base for open-ended natural selection a-life model.

More info:

• Open-ended natural selection of interacting code-data-dual algorithms as a property analogous to Turing completeness
• Wolfram Physics Project

Main reddit discussion (contain copies from other sources as well):

reddit.com/r/DigitalPhilosophy, backup (2020)

from ultimate-question.

Where to find more on abstract rewriting systems: https://news.ycombinator.com/item?id=22871806

from ultimate-question.

I'm interested in research direction of using code-data dual algothms that modify each other and form natural selection process to formally abstract notion of evolutional open-endedness (like Turing completeness is an abstraction of algorithms notion). More details: https://www.reddit.com/r/DigitalPhilosophy/comments/dzghec/openended_natural_selection_of_interacting/

Maybe you could advise some developed language or model for this task? The interesting part is to have code-data duality and enough rich language to kick start natural selection that would produce competing algorithms that would gradually become more and more complex (and gradually become closer to sentience).

Though the language might not even be Truring complete as it is. As natural assumption would be that the model should be finite in resources and it can get access to infinite time or memory only in time limit (assuming that the individual algorithms would survive for this to happen).

from ultimate-question.

Buddha-Darwinism on objective meaning of life separated from subjective meaning of life (Сosmogonic myth from Darwinian natural selection, Quasi-immortality, Free will, Buddhism-like illusion of Self) aka Application of Universal Darwinism to evaluation of goals and values

from ultimate-question.

Evaluating terminal values.

Discussion on this topic is aggregated in this GitHub discussion and here.

from ultimate-question.

Novelty emergence mechanics as a core idea of any viable ontology of the universe

Main reddit discussion (contain copies from other sources as well):

reddit.com/r/DigitalPhilosophy, backup (2021)

from ultimate-question.

Support me on Patreon

from ultimate-question.