Full Transcript

·YouTLDR

EMERGENCE.

1:55:311,406 summary words · ~7 min readEnglishBy Machine Learning Street TalkTranscribed Aug 1, 2026
Analyze another video with Pro30-day money-back guarantee
Summary

Emergence spans a spectrum from computationally irreducible weak emergence in local dynamical rules to controversial strong downward causation, showing how simple local update operations—when generalized to Continuous and Graph Neural Cellular Automata—can generate robust, self-healing macro-structures without top-down control.

Bridging discrete local interactions and macro-level emergent architectures provides machine learning with a blueprint for creating self-assembling, fault-tolerant AI systems that transcend brittle human-engineered neural network paradigms.

Section summaries

0:00-2:54

Introduction: The Emergence Ladder and Specialization

watch

Tim Scarfe introduces the episode from Lisbon, defining the core theme around strong and weak emergence, cellular automata, and graph cellular automata. He highlights how metrics shift across organizational levels—from concrete micro-metrics in engineering to unquantifiable macro-concepts like trust and engineering culture. The hosts discuss how population-driven algorithms foster specialization, contrasting this with machine learning's conventional obsession with generalist models.

  • Organizational and computational systems display different properties depending on the observer's level of abstraction.
  • Population scale algorithms implicitly favor hyper-specialization over generalist optimization.

Sets up the overarching theoretical framework and personal motivations behind studying multi-scale emergence.

2:54-8:42

Philosophical Roots: Reductionism, Relationism, and Weak Emergence

watch

Scarfe explores classical definitions of emergence, citing John Locke, Melanie Mitchell's army ant superorganisms, and Peter Corning's relationism. He contrasts Western science's reductionist pursuit of fundamental essences with relational context-dependent effects. The discussion turns to Mark Bedau’s 1999 paper on weak emergence, defining it through computational irreducibility and local interactions while dismissing strong emergence and downward causation as conceptually akin to magic.

  • Weak emergence occurs when macro-states arise from micro-dynamics but can only be calculated via direct simulation.
  • Bedau argues strong emergence relies on dubious downward causation that conflicts with physical materialism.

Essential breakdown of the foundational philosophical debates between physical reductionism and weak emergence.

8:42-14:30

Strong Emergence, Theoretical Physics, and Causal Exclusion

optional

The episode analyzes Dr. Sabine Hossenfelder's arguments regarding reductionism, effective field theory, and physical theory hierarchies. While effective field theory and the causal exclusion argument suggest higher-level phenomena cannot have separate causal powers, Hossenfelder highlights edge cases where coupling constraints cannot be mathematically continued, leaving room for strong emergence. David Chalmers' distinction between observer-relative weak emergence and non-deducible strong emergence is also introduced.

  • Causal exclusion implies that if a micro-theory explains an effect, macro-theories cannot claim independent causation.
  • Chalmers defines strong emergence as high-level truths that are logically non-deducible even in principle from micro-physics.

Deep dive into theoretical physics and formal philosophy of science that may be overly abstract for purely ML-focused viewers.

14:30-23:12

Consciousness, Tangled Hierarchies, and Level Independence

optional

David Chalmers, in audio commentary, identifies human consciousness as the sole indisputable instance of strong emergence, using philosophical zombies to argue phenomenological experience is not deducible from physical facts alone. Douglas Hofstadter's concept of tangled hierarchies and strange loops from 'Gödel, Escher, Bach' is contrasted with rigid level hierarchies. The hosts and guests discuss whether computational limits effectively constitute strong emergence in practical scenarios.

  • Chalmers posits phenomenological consciousness as the premier candidate for strong physical emergence.
  • Hofstadter’s strange loops demonstrate how complex systems form bi-directional causal loops across abstraction layers.

Explores consciousness and cognitive science parallels, useful for philosophical context but tangential to computational cellular automata.

23:12-31:54

Complex Systems, Market Dynamics, and Unbounded Computation

watch

Scarfe examines Melanie Mitchell's three core properties of complex adaptive systems: collective behavior without central control, information processing, and adaptation. Examples include ant colony behavior, economic markets self-organizing via Adam Smith's invisible hand, and biological neural networks. A guest clip featuring Dr. Joscha Bach explores spatial infinity, Gödelian limitations in formal languages, and why physical reality cannot run on infinite computational steps.

  • Complex adaptive systems process information locally to produce self-organizing global equilibria.
  • Joscha Bach argues physical reality is computationally bounded, rendering actual infinity mathematically unusable in concrete systems.

Provides clear real-world examples of self-organization across biology, economics, and computational physics.

31:54-40:36

Cellular Automata Foundations and Morphogenetic Engineering

watch

The conversation shifts to standard cellular automata, tracing their origin from John von Neumann to John Conway's Game of Life. Scarfe details how binary grid rules create Class 4 Turing-complete behavior and computational irreducibility. He then introduces Dr. Sebastian Risi's work on morphogenetic engineering, combining deep learning with self-organizing systems to create robust, self-assembling AI that overcomes the brittleness of standard neural networks.

  • Conway's Game of Life proves that extremely simple 2D grid rules can generate universal computation.
  • Morphogenetic engineering uses local self-assembly rules to compress structural blueprints into genomic bottlenecks.

Core transition section connecting classical cellular automata to modern deep learning and morphogenetic engineering.

40:36-49:18

Genomic Compression, Decentralization, and Neural Cellular Automata

watch

The hosts discuss how biological genomes encode self-wiring rules rather than explicit brain blueprints, creating resilience against brain damage or sensory loss. Alexander Mordvintsev's 'Growing Neural Cellular Automata' paper is introduced, showing how 2D convolutional networks learn local update rules that regenerate and repair damaged target images. Dr. Danielle Gratarola joins the interview to discuss his background in graph neural networks and protein structure prediction.

  • Biological genomes use developmental compression rather than explicit architectural blueprints.
  • Neural cellular automata learn local convolutional updates capable of dynamic self-healing and image reconstruction.

Introduces the central interview subject and key neural cellular automata concepts.

49:18-58:00

Continuous Cellular Automata and Discretization Boundaries

watch

Dr. Danielle Gratarola discusses the transition from discrete binary grids to continuous, high-resolution cellular automata. He highlights how expanding state spaces creates lifelike organic structures such as moving membranes. Scarfe draws parallels to numerical finite-difference techniques used in engineering to approximate partial differential equations, raising the question of whether cellular automata are simply discrete numerical approximations of continuous physics.

  • Continuous cellular automata generate organic, lifelike structures by expanding state dimensions beyond binary states.
  • Finite-difference modeling reveals that local cell update rules closely mirror continuous partial differential equations.

Deepens the mathematical understanding of continuous state spaces in cellular automata.

58:00-1:09:36

Multiscale Abstractions, Rule 110, and Initial State Complexity

optional

Gratarola and the hosts explore how observers alternate between continuous and discrete descriptions across physics, molecular biology, and human social dynamics. They discuss Stephen Wolfram's 'A New Kind of Science' and Matthew Cook's proof of Rule 110's Turing completeness. Gratarola explains that while CA update rules remain simple, complex macro-behavior is heavily encoded into the initial state configurations.

  • System models alternate between continuous and discrete representations across different observational scales.
  • Rule 110 demonstrates universal computation in 1D space, though computational complexity relies heavily on state configuration.

Explores Wolfram's physics paradigm and 1D CA theory; helpful for theoretical completeness.

1:09:36-1:27:00

Computational Irreducibility and Neural Update Rules

watch

The conversation focuses on computational irreducibility—the principle that predicting CA behavior requires running the full simulation without analytical shortcuts. Gratarola discusses using machine learning to discover localized update rules that achieve macro-scale target goals without simulating full universe substrates. He examines Mordvintsev's neural cellular automata, where convolutional networks learn local updates that regenerate damaged lizard images.

  • Computational irreducibility prevents analytical shortcuts, requiring step-by-step execution to observe outcomes.
  • Neural networks can learn local update functions that converge on complex target shapes despite random perturbations.

Key technical explanation of how neural networks parameterize local cellular update rules for image morphogenesis.

Key points

  • Weak vs. Strong Emergence and Computational Irreducibility — Weak emergence arises when macroscopic complexity is generated from simple micro-rules but can only be deduced through finite step-by-step simulation due to computational irreducibility. In contrast, strong emergence asserts that higher-level properties possess irreducible downward causal powers independent of underlying physical dynamics.
  • Scale-Dependent Abstractions and Interleaved Continuum/Discrete Dynamics — Modeling complex phenomena oscillates between continuous differential equations and discrete local agent representations depending on the observer's resolution scale. Neither domain completely eliminates the other, creating semi-autonomous layers of description where lower-level details are compressed into localized interaction rules.
  • Neural Cellular Automata and Morphogenetic Self-Organization — Replacing hand-designed discrete transition rules with parameterizable, learned neural network update functions—such as 2D convolutional networks—enables self-assembling patterns that recover global coherence from localized damage. By training update operations iteratively, local cells communicate through receptive fields to repair global image structures.
  • Graph Cellular Automata (GCA) and Non-Euclidean Emergence — Extending cellular automata from regular 2D lattices to arbitrary graph topologies allows neural message-passing rules to operate across unstructured geometric domains like point clouds or dynamical networks. Dr. Danielle Gratarola demonstrates that Graph Cellular Automata can self-assemble 3D shapes purely from localized message exchanges among neighboring nodes.
the solitary army ant is behaviorally one of the least sophisticated animals imaginable... yet if you put half a million of them together the group as a whole becomes what some have called a super organism with collective intelligence Tim Scarfe
weak emergence is present in almost all complex systems regardless of whether they produce chaotic dynamics Tim Scarfe

AI-generated from the transcript. May contain errors.

0:00

in this episode of street talk unplugged

0:02

and so one thing that i find fascinating

0:04

is that there is absolutely no reason

0:08

why this should work like at all there

0:10

is nothing that we can observe that says

0:13

that these kinds of rules should exist

0:15

at all this this model in principle is

0:18

it's like it's too simple for it to

0:20

actually work

0:24

welcome back to street talk

0:29

this week we are coming live from lisbon

0:31

in portugal i haven't had access to my

0:34

studio or any of my uh you know normal

0:36

recording equipment so it's going to be

0:38

a bit of an interesting one but i've

0:39

been working out of coffee shops

0:41

building an introduction doing all my

0:43

stuff so yeah it's going to be a show

0:45

about strong and weak emergence

0:48

about cellular automata and we're going

0:49

to be interviewing dr danielle gratarola

0:52

and speaking all about his work on graph

0:54

cellular automata so i hope you enjoy it

0:57

folks

0:58

see you soon

0:59

one thing that really fascinates me is

1:01

um a lot of the interesting phenomena

1:04

happens at a different level a different

1:07

rung of the emergence ladder if that

1:10

makes sense and i'm starting to see this

1:12

everywhere like even at work i'm

1:13

building a code review platform and at

1:15

the low level the metrics are obvious

1:18

i know ken talks about the uh the

1:19

tyranny of metrics by the way but you

1:21

know it's how many code reviews that has

1:24

an engineer done how many customer

1:26

engineers do i have it's easy and then i

1:28

start going up the levels of abstraction

1:30

i'm talking to the senior leaders and

1:32

now i'm starting to use much more

1:34

abstract language like vertical

1:36

information flows and trust and

1:38

engineering culture

1:40

and all of a sudden it's impossible for

1:42

me to quantify and if i do i'm making it

1:44

up and it's the same thing

1:46

you're talking about these population

1:47

scale phenomena that happen now so i've

1:49

got all of these intelligent agents

1:51

they're doing things and and i can try

1:53

and because now i've got a meta

1:55

optimization problem right so i want to

1:57

encourage interesting phenomena

2:00

in the emergent scale so i might say

2:02

well this type of thing is interesting i

2:04

want more of that but i'm i'm kind of

2:07

i'm reaching because i don't know how to

2:08

describe it i mean i think one other one

2:11

other characteristic you can point to

2:12

that that kind of separates um like

2:15

population from just individual is

2:18

sort of specialization versus

2:19

generalization like i think population

2:22

driven algorithms sort of

2:24

implicitly are more about specialization

2:26

a lot of the time because like each

2:29

member of the population you want to be

2:30

doing some different thing

2:31

so they're kind of becoming specialists

2:33

but i think there's a huge amount of

2:34

generalization snobbery kind of within

2:36

machine learning like we're looking for

2:38

the ultimate general list all the time

2:40

it's like get it to do all the tasks you

2:42

can possibly do and then throw more in

2:43

and the data set just gets bigger and

2:44

we're all very impressed with that the

2:46

population implies i feel like

2:48

something's in spirit different because

2:50

it's more just like

2:51

actually i want to see a lot of

2:53

different things and like hyper

2:54

specializations to all kinds of exotic

2:56

things that like probably the generals

2:57

won't do because it's basically all

2:59

cares about is being general this comes

3:02

down to like the focus on like the

3:04

particular level of abstraction or the

3:06

level of agency that we have professor

3:08

melanie mitchell wrote a beautiful book

3:10

on complexity about 10 years ago i hope

3:14

one day we can get it back on the

3:15

podcast and discuss it in detail in the

3:17

book she led with a quote from john

3:20

locke

3:21

i call complex

3:22

such as our beauty gratitude a man

3:27

an army

3:28

the universe

3:30

the animal kingdom has several examples

3:32

of what i would call externalized or

3:36

collective intelligence

3:37

melanie quote biologist nigel franks in

3:40

her book

3:42

the solitary army ant is behaviorally

3:45

one of the least sophisticated animals

3:47

imaginable

3:48

if 100 army ants are placed on a flat

3:51

surface

3:53

they will walk around and around in

3:56

never decreasing circles until they die

3:59

of exhaustion

4:01

yet if you put half a million of them

4:02

together the group as a whole becomes

4:05

what some have called a super organism

4:08

with collective intelligence

4:11

the whole is in some sense more than the

4:13

sum of its parts although we need to be

4:16

quite careful with the language that we

4:17

use here

4:19

an emergent behavior or emergent

4:21

property can appear when a number of

4:23

simple entities or agents operate in an

4:26

environment forming more complex

4:28

behaviors as a collective

4:31

if emergence happens over disparate size

4:33

scales then the reason is usually a

4:35

causal relation between different scales

4:39

western science has a strong tendency

4:41

towards reductionism because it assumes

4:44

that things have essences so science

4:47

keeps chopping up things into smaller

4:49

and smaller pieces to find their essence

4:52

it's an intellectual and philosophical

4:54

position which interprets a complex

4:57

system as the sum of its parts

4:59

this is in stark contrast with

5:01

relationism which you could say is

5:03

related to the philosophical ideas we

5:05

were discussing with andrew lampanen

5:07

from deepmind last week

5:08

biologist peter corning asserted that

5:10

this whole discussion rather misses the

5:13

point

5:14

he said that holes produce unique

5:16

combined effects but many of these

5:18

effects may be co-determined by the

5:21

context and the interactions between the

5:23

whole and its environments

5:26

now weak emergence describes new

5:29

properties arising in systems as a

5:31

result of low-level interactions these

5:34

might be interactions between components

5:36

of the system or components and their

5:38

environment

5:40

emerging properties are scale dependent

5:42

though and can only be observed at large

5:44

enough system scale one reason emergent

5:46

behavior is hard to predict is that the

5:48

number of interactions between a

5:50

system's components increases

5:52

exponentially with the number of

5:53

components thus allowing for many new

5:56

and subtle types of behavior to emerge

5:59

emergence is often a product of

6:01

particular patterns of interaction

6:03

negative feedback introduces constraints

6:06

that serve to fix structures or

6:08

behaviors in contrast positive feedback

6:11

promotes change allowing local

6:13

variations to grow into global patterns

6:16

on the other hand merely having a large

6:18

number of interactions is not enough by

6:20

itself to guarantee emergent behavior

6:24

many of the interactions may be

6:25

negligible or irrelevant or may cancel

6:28

each other out in some cases a large

6:30

number of interactions can in fact

6:32

hinder the emergence of interesting

6:34

behavior by creating a lot of noise to

6:37

drown out any emerging signal

6:40

the system has to reach a combined

6:42

threshold of diversity organization and

6:44

connectivity before emergent behavior

6:47

appears

6:48

mark bedau said in his 1999 paper titled

6:51

weak emergence that an innocent form of

6:54

emergence what he called weak emergence

6:57

is now commonplace in the thriving

6:59

interdisciplinary nexus of scientific

7:02

activity sometimes called the sciences

7:05

of complexity interestingly which he

7:07

elected to put in air quotes for some

7:09

reason

7:10

he said that this included connectionist

7:13

modelling and non-linear dynamics which

7:15

is now commonly known as chaos theory

7:17

and indeed artificial life

7:19

he gave two interesting hallmarks of

7:21

emergent phenomena in his opinion

7:24

one emergent phenomena are somehow

7:27

constituted by

7:28

and generated from

7:30

an underlying process

7:32

and two

7:33

emergent phenomena are somehow

7:35

autonomous from the underlying process

7:39

so he said that emergence is a perennial

7:41

philosophical puzzle and at best the

7:44

idea raises the spectre of

7:46

illegitimately getting something from

7:49

nothing

7:50

he said that any defense of emergence

7:53

should aim to explain that is to say

7:55

explain away

7:57

the apparent illegitimate metaphysics

8:00

and indeed demonstrate emergence to be

8:02

entirely compatible with materialism

8:06

he argued that emergence must be more

8:08

than intellectual masturbation putting

8:10

words in his mouth here and actually

8:12

demonstrate tangible value to the

8:14

empirical sciences and be a constructive

8:17

player in our understanding of the

8:18

natural world

8:20

he argued that weak emergence meets

8:22

these goals but argued that stronger

8:24

forms of emergence are entirely

8:26

irrelevant

8:28

he said that the failings of strong

8:29

emergence can be traced back to this

8:31

idea of strong downward causation which

8:34

is this notion that things in the lower

8:36

resolution emergent domain can cause

8:39

things in the high resolution domain

8:41

mark said that strong emergence is

8:43

uncomfortably like magic

8:46

how does a super veniant but irreducibly

8:48

downward causal power arise since by

8:51

definition it cannot be the result of

8:53

the high resolution domain he said this

8:55

would discomfort reasonable forms of

8:57

materialism and pay homage to the idea

9:00

that it's possible to get something from

9:02

nothing

9:03

mark concluded by saying that strong

9:05

emergence is just a mystery which we

9:07

don't need

9:09

it's interesting to note that his

9:10

definition of weak emergence is as

9:12

follows

9:13

macro state p of s with micro dynamic d

9:17

is weakly emergent if and only if p can

9:21

be derived from d

9:22

and s is external conditions but only by

9:26

simulation so interestingly his

9:28

definition incorporates the necessity

9:30

for computational irreducibility but not

9:33

the notion of whether it is effectively

9:35

computable

9:37

one of the main hallmarks of weak

9:38

emergence is the underrivability except

9:41

for finite simulation the exponential

9:43

divergence of trajectories or indeed the

9:46

so-called butterfly effect describing

9:48

the sensitivity of a physical simulation

9:50

on its starting parameters is a

9:52

well-known feature of chaotic systems

9:54

but mark says that weak emergence is

9:56

present in almost all complex systems

9:59

regardless of whether they produce

10:00

chaotic dynamics which lead to weak

10:03

emergence being part of the definition

10:05

of what it means to be a complex system

10:08

the popular physics youtuber dr sabine

10:11

hossenfelder wrote a paper called the

10:13

case for strong emergence she felt that

10:16

weak emergence was too deterministic and

10:19

a front on free will if you like

10:22

she used to think that we're all made of

10:24

tiny particles which follow strict laws

10:26

and human behavior is really just a

10:28

consequence of these particles laws

10:30

needless to say she's since changed her

10:33

mind and she thinks that you should as

10:35

well

10:36

she led by saying reductionism works

10:39

large things are made of smaller things

10:41

and if you know what the smaller things

10:43

do you know what the larger things do

10:46

physicists call this idea reductionism

10:49

now you might not like it but it works

10:51

pretty well arguably reductionism

10:53

allowed us to understand molecular bonds

10:55

and chemical elements atomic fission and

10:58

fusion the behavior of an atom's

11:00

constituents and the constituents of

11:02

those constituents and whoever knows

11:05

what the physicist will come up with

11:06

next she said

11:08

she admits that the best explanation for

11:10

the world around us right now is almost

11:12

certainly incomplete

11:14

sabine decided to discuss the concept of

11:17

emergence in respect to physical

11:18

theories and how fundamental they are

11:21

she said that a physical theory is a set

11:23

of mathematically consistent axioms

11:26

combined with an identification of some

11:28

of the theory's mathematical structures

11:30

with observables

11:31

if two physical theories give the same

11:34

predictions for all possible observables

11:36

then they are physically equivalent

11:39

she displayed a figure depicting a

11:41

directed graph of physical theories an

11:43

edge between two theories meant that one

11:46

was more fundamental than the other

11:48

she said that a physical theory a is

11:51

more fundamental than b if b can be

11:53

derived from a but not the other way

11:56

around

11:57

in this case the theory b is weakly

11:59

emergent from a

12:01

a physical theory is fundamental if it

12:04

is to the best current knowledge not

12:06

emergent from any other theory so this

12:08

is quite interesting weekly emergent is

12:10

the opposite of more fundamental the

12:13

idea that the theory at low resolution

12:15

is always weakly emergent it can be

12:17

derived at least in principle from the

12:19

theory at high resolution

12:21

sabine also discussed the causal

12:23

exclusion argument which roughly

12:24

speaking says that if a lower resolution

12:27

effect can be derived from a theory at

12:29

high resolution then the effect cannot

12:31

have another cause the causal exclusion

12:34

argument combined with effective field

12:35

theory is the main reason why physicists

12:37

believe that reductionism is correct and

12:39

in a sense why strong emergence is not a

12:42

thing

12:43

she also spoke about top-down causation

12:45

which is this idea that the laws of a

12:47

system at low resolution can dictate the

12:49

laws at high resolution

12:51

a good example of this is the mental

12:53

states in our brain causing our bodies

12:55

to perform physical actions

12:58

so it's important not to think of the

12:59

emergent layers as being independent or

13:01

assuming that they could or should be

13:03

modeled in isolation interestingly

13:05

though in sabine's article she denied

13:07

that top-down causation even exists at

13:10

all

13:11

in her conclusion sabine did a 180

13:14

degrees and she decided that in fact

13:16

there are many examples where there

13:17

isn't a clear effective computational or

13:20

functional path between physical

13:22

theories she gave a hypothetical example

13:24

of a function which cannot be computed

13:27

for negative values of x or a taylor

13:29

series expansion around zero and she

13:31

said that if there are any points where

13:33

the coupling can't be continued between

13:35

resolutions you'll need new initial

13:37

values which would need to be determined

13:39

by measurement and therefore strong

13:41

emergence is viable

13:43

she said it's only fair on philosophers

13:45

who believe that strong emergence exists

13:48

that physicists first show the coupling

13:50

constraints of a quantum field theory

13:52

can always be continued to low energies

13:55

for physically realistic systems

13:58

so what is emergence emergence is just

14:01

the interpretation of a phenomenon from

14:03

the perspective of a different scale at

14:06

least according to professor david

14:09

chalmers

14:10

he wrote a paper called strong and weak

14:11

emergence where he lamented the abuse of

14:14

the term strong emergence by complex

14:16

systems scientists and cognitive

14:18

scientists echoing mark badal before him

14:22

chalmers says that it is strong

14:24

emergence which is most common in the

14:26

philosophical parlance of emergence and

14:28

in particular used by the british

14:30

emergentists of the 1920s he thought

14:33

that we could say a high-level

14:35

phenomenon is strongly emerging with

14:37

respect to a low-level domain when the

14:40

high-level domain phenomenon arises from

14:42

the low level domain but truths

14:45

concerning that phenomenon are not

14:46

deducible even in principle from truths

14:50

in the low level domain

14:52

now i think deducible is a bit of a

14:54

weasel word but we'll talk more about

14:56

that in a minute um he says that weak

14:59

emergence does not yield the same sort

15:01

of radical metaphysical expansion in our

15:05

conception of the world as strong

15:07

emergence but it's no less interesting

15:10

he says that you can think of weak

15:12

emergence in terms of the ease of

15:13

understanding of one level in terms of

15:16

another level

15:18

emergent properties are usually

15:19

properties which are more easily

15:21

understood in their own right than in

15:23

terms of properties at a lower level

15:26

indicating that weak emergence appears

15:28

to be an observer relative property

15:31

now how interesting is this high level

15:32

phenomenon to an observer and how

15:35

difficult is it to deduce this

15:36

phenomenon from the lower level that is

15:39

emergence

15:41

so chalmers takes emergence in the

15:43

general sense to mean surprising or

15:46

interesting and indeed an unexpected

15:48

phenomena and he uses the strong versus

15:51

weak designation to delineate a radical

15:54

paradigmatic surprise

15:57

he says that the emergence of high-level

15:59

patterns and cellular automata a

16:01

paradigm of emergence in recent complex

16:03

systems theory provides a clear example

16:06

if one is given only basic rules

16:09

governing a cellular automaton then the

16:11

formation of complex high-level patterns

16:13

such as gliders may well be unexpected

16:16

therefore the patterns are weakly

16:19

emerging but the formation of those

16:21

patterns is straightforwardly deducible

16:23

from the rules and the initial

16:25

conditions

16:26

he concedes that this might take a fair

16:28

amount of computation

16:31

which he indicates as a reason why the

16:33

emergent behavior wasn't obvious to

16:35

start with and i assume by the word

16:37

obvious he's kind of

16:38

means as an autonym to unexpected

16:42

cellular automata are provably

16:44

computationally irreducible this means

16:46

that there are no analytical shortcuts

16:48

to perform the effective calculation

16:50

without resorting to running the

16:52

sequential simulation in its entirety

16:56

since the computational domain is

16:57

exponentially large in the case of

16:59

discrete cellular automata and

17:01

infinitely large in the case of

17:03

continuous cellular automata if you were

17:05

trying to find the initial conditions

17:07

and rules for a given behavior or even

17:09

if you had to recompute the simulation

17:11

we would argue that this constitutes at

17:13

least a semi-strong designation of

17:15

emergence because of the effective

17:18

computability right the effective

17:20

computability must come into it

17:23

professor chalmers says that strong

17:24

emergence has much more radical

17:26

consequences than weak emergence if

17:28

there are phenomena that are strongly

17:30

emergent with respect to the domain of

17:32

physics then our conception of the

17:34

natural world would need to be

17:35

revolutionized to accommodate them with

17:38

new fundamental theories

17:40

now i find this a little bit strange i

17:42

mean given that a class iv cellular

17:43

automata is touring incomplete which is

17:45

to say that they can represent any

17:47

computer program it seems like a

17:49

contentious point that there's no

17:51

possible output in a cellular automata

17:53

which would be paradigmatically

17:54

surprising maybe i'm wrong

17:57

to be clear chalmers is a materialist

18:00

right he's not subscribing to any kooky

18:02

views by saying this he's a

18:03

computationalist in the sense that he

18:05

agrees that if he replicated him atom by

18:08

atom in the natural world according to

18:10

our universe then it would have a

18:13

consciousness right but he argues that

18:16

consciousness isn't a logical necessity

18:18

he could imagine a universe which has

18:20

all the same physical laws where he

18:22

would be a philosophical zombie because

18:24

it's not logically necessary yeah so

18:26

this term emergence is you know it's so

18:29

woolly and uh

18:31

ambiguous i mean it gets used for so

18:32

many different things

18:34

uh in the sciences in philosophy any

18:37

kind of phenomenon of a complex system

18:39

that we don't fully understand we say oh

18:41

yeah well it's emergent and then okay

18:44

well great well what's the cash value of

18:46

uh of that and i've found it useful to

18:48

distinguish as you were weak and strong

18:52

emergence where weak emergence is kind

18:54

of a matter of mostly of complexity

18:57

um where for example you've got some

18:58

simple rules at the bottom level that

19:00

gives rise to some high level

19:02

macroscopic phenomenon

19:04

which is complex and surprising

19:08

hard to predict and derive as a

19:10

practical matter

19:12

but it's really more of a practical

19:14

limitation you can still see in

19:15

principle why those bottom level

19:18

principles say laws of physics or

19:21

rules in a cellular automaton would in

19:24

principle give rise to these high-level

19:27

phenomena derivable and principle if not

19:29

in practice whereas strong emergence

19:32

would require something that's not even

19:33

derivable in principle and i guess i

19:36

think that most of the things you get in

19:38

ai or

19:40

complex systems theory and so on involve

19:43

weak emergence certainly i was very

19:45

influenced by um

19:47

doug hofstadter here who's

19:48

who's you know good alicia bark is in

19:50

some ways all about the powers of weak

19:52

emergence how

19:54

really

19:55

simple processes at one level could give

19:57

you complex processes

19:59

at a higher level and actually get these

20:02

tangled hierarchies he'd talk or strange

20:05

loops you'd go up a few levels and then

20:07

you'd you'd come down so i guess i'm

20:09

probably more sympathetic with

20:10

hofstadter's picture of weak emergence

20:13

than say george ellis's where causation

20:15

is always within a level i think there

20:17

are very complex relations between the

20:20

levels and some of them may be best

20:22

understood as causal you could think of

20:24

it you know the butterfly

20:26

um

20:28

snapping its wings having some causal

20:30

relation to some sociological event days

20:34

later so you do get these

20:36

tangled hierarchies but all that is

20:38

still weak emergence

20:40

so he's agreeing with mark badal by

20:43

saying that any endorsement of strong

20:45

emergence is a rejection of physicalism

20:48

and reductionism which is to say an

20:50

appeal to magic and esoterica

20:53

whereas weak emergence can be used to

20:55

support the physicalist picture of the

20:56

world by showing how all sorts of

20:58

phenomena which might seem novel and

21:00

irreducible at first sight can

21:02

nevertheless be grounded in underlying

21:04

simple physical laws

21:07

chalmers thinks that there is exactly

21:09

one clear example of strong emergence in

21:12

our universe which is guess what our

21:16

consciousness

21:17

[Music]

21:18

we can say that a system is conscious

21:20

when there is something it is like to be

21:23

that system which is to say it has a

21:26

phenomenological experience

21:28

chalmers argues that it is a fact of

21:30

nature that the universe contains

21:32

conscious systems we are existence

21:35

proofs of that and there's reason to

21:37

believe that the facts about

21:38

consciousness are not deducible from any

21:41

number of physical facts it makes the

21:43

argument that there could be a world

21:44

physically identical to this one but

21:46

lacking consciousness entirely which is

21:48

very similar to that philosophical

21:50

zombies argument that i just spoke about

21:52

or even containing conscious experiences

21:55

which are potentially different to our

21:56

own roger penrose said that the human

21:58

ability to understand is undecidable and

22:01

requires consciousness

22:03

if this is true it might be a

22:04

mathematical proof that consciousness is

22:07

strongly emergent exactly as charm as

22:09

claims

22:10

and so

22:11

the way i the way i view strong

22:13

emergence at least for for right now is

22:15

that if i have these different

22:16

formalizations at different levels

22:19

and it's just not possible in any

22:22

practical

22:23

scheme whatsoever for me to directly

22:27

go from

22:28

a lower level to a higher level like for

22:30

example i just can't computationally do

22:33

it or there's

22:34

no mathematics that can ever hope to

22:36

symbolically you know prove that that uh

22:39

the properties i observe at a higher

22:41

level derive from a lower level

22:43

maybe i you know people say well in

22:45

principle you could but in reality you

22:47

just may never be able to do that you

22:49

know does that qualify as strong

22:51

emergence or is that a bad definition of

22:53

it and do you think there is such a

22:55

thing as strongly emergent behavior or

22:58

can we ultimately just reduce everything

23:00

down to

23:01

uh hypergraph or or loop chrom quantum

23:04

gravity or whatever

23:06

every level a sense is independent you

23:09

cannot expect it to be fully reduced to

23:12

a lower one or okay a higher one

23:16

or each level has its own value it has

23:19

its

23:20

concepts it has these conclusions it has

23:23

problems that's suitable to be to be

23:26

solved at the level not higher or lower

23:29

that is

23:31

to me that's the first principle but the

23:33

second one is you don't want to push it

23:34

too far you don't want to say all the

23:37

layers have nothing to do with each

23:38

other

23:39

so as after all we're talking about the

23:42

same object okay we're talking about the

23:45

same that the google map of the same eye

23:48

area even though you zoom in block out a

23:51

different level if he is

23:53

a two map a different array that's a

23:55

different story okay so as far as all

23:58

those theories

24:01

is in a sense about the same object but

24:04

there is the different levels of

24:05

description

24:06

and they are correlated but they are

24:09

kind of like

24:11

very overall high level uh

24:15

not high level is the wrong way to say

24:17

it is confusing

24:19

the relation it's kind of like you have

24:21

a overall

24:23

large scale

24:24

correlation

24:25

but you don't have one-to-one mapping

24:27

among the concepts that's also my

24:29

opinion about the relation for example

24:31

between neurons and concepts

24:34

uh of course they're related but there

24:36

is no one to unmapping or if not even

24:39

money problem might be

24:40

it's more like a money to mine in my

24:42

opinion and also it's very messy in my

24:44

opinion

24:45

uh except if you want to limit your

24:48

discussion

24:49

to a very special phenomena at a certain

24:53

level for example we know that some

24:55

basic concepts in chemistry

24:58

can be explained very well in physics

25:01

right

25:02

because villains talk about the details

25:04

uh the same story of something in

25:07

biology can be explained very well with

25:10

physics and chemistry we should talk

25:11

about the details

25:13

so that's true but on the other hand if

25:16

you say that

25:18

biology overall can be even truly

25:20

reduced it to chemistry and uh feelings

25:25

i say not only that's practically wrong

25:28

is even theoretically wrong

25:30

because when you're seeing that

25:33

you're ignoring

25:34

the

25:35

cognitive capability

25:38

of the researcher

25:40

and the user of your theory you cannot

25:42

really reduce everything

25:45

to

25:46

uh to the to the lower level without

25:48

greatly increase the number of concepts

25:51

right computational cost

25:53

melanie mitchell pointed out that it's

25:55

incredibly mysterious how the intricate

25:58

machinery of the immune system fights

26:00

disease or how a group of cells

26:02

organizes itself to be an eye or a brain

26:06

or how independent members of an economy

26:08

each working chiefly for their own gain

26:11

produce complex but structured global

26:13

markets

26:14

or most mysteriously how the phenomena

26:17

we call intelligence or consciousness

26:21

emerge from non-intelligent

26:23

non-conscious material substrates

26:27

the cognitive scientist douglas

26:28

hofstadter in his book go to lescherbach

26:30

made an extended analogy between ant

26:33

colonies and brains both being complex

26:36

systems in which relatively simple

26:38

components with only limited

26:40

communication among themselves

26:42

collectively give rise to complicated

26:45

and sophisticated system-wide global

26:47

behavior

26:48

the ants in our human brain are of

26:50

course our neurons they communicate with

26:53

each other in a similarly simplistic

26:54

manner yet our intelligence and arguably

26:58

our consciousness emerge from this

27:00

low-level primitive communication

27:02

markets are also complex emergent and

27:06

self-organizing entities if you like

27:09

melanie said in her book that they are

27:10

self-organized on the microscopic and

27:13

the macroscopic level she said that on

27:15

the microscopic level individuals and

27:18

companies and markets try to increase

27:21

their profitability by learning about

27:23

the behavior of other individuals and

27:25

companies

27:26

the microscopic self-interest has

27:28

historically thought to push markets as

27:31

a whole on the macroscopic level towards

27:33

a so-called nash equilibrium

27:36

now the process by which markets obtain

27:39

this equilibrium is called the market

27:41

efficiency

27:42

the 18th century economist adam smith

27:44

called this self-organizing behavior of

27:46

markets the invisible hand

27:49

it arises from the myriad microscopic

27:52

actions of individual buyers and sellers

27:55

the individual actions on a trading

27:57

floor give rise to the hard to predict

27:59

large-scale behavior of financial

28:01

markets

28:02

now melanie gives three core properties

28:05

of complex systems in her book

28:07

one

28:08

complex collective behavior

28:10

large networks of individual components

28:13

which each one following relatively

28:15

simple rules with no central control or

28:18

leader it's the collective action of

28:21

vast numbers of components that give

28:24

rise to the complex hard to predict and

28:26

changing patterns of behavior which

28:28

fascinate us so much

28:30

[Music]

28:31

two

28:32

signaling and information processing

28:35

complex systems use information and

28:36

signals from both their internal and

28:39

external environments

28:41

and three

28:42

adaptation all of these systems adapt

28:46

that is they change their behavior to

28:48

improve their chances of survival or

28:50

success through learning or some

28:52

evolutionary process

28:54

so melanie then goes on to give her

28:55

definition of a complex system as

28:57

follows

28:59

a system in which a large network of

29:01

components with no central control and

29:03

simple rules of operation give rise to

29:06

complex collective behavior

29:08

sophisticated information processing and

29:11

adaptation by learning or evolution

29:14

now i spoke with our friend dr duggar on

29:17

strong emergence and he said that in his

29:20

opinion it describes behaviors which

29:22

cannot be analytically derived nor

29:25

effectively computed from a lower level

29:28

or higher resolution theory this would

29:31

place glider wars in a cellular

29:33

automaton firmly in the domain of strong

29:36

emergence

29:37

a cellular automaton is computationally

29:39

irreducible there's no effective

29:42

computational path from the lower level

29:44

rules to the higher level behavior the

29:47

only thing you can do is run the

29:49

simulation again from scratch

29:52

he thought that chalmers and

29:53

hossenfelder evade the issue and or beg

29:57

the question by phrases like deducible

30:00

in principle or a fair amount of

30:03

computation or follows from that at

30:06

least in principle etcetera etcetera so

30:09

you know what he's saying is that they

30:11

make claims which

30:13

we can in principle do something but

30:16

they can't actually demonstrate or

30:17

perform with a reasonable amount of

30:19

computation

30:21

in physical strong emergence you can't

30:23

even run the computation at least in a

30:25

continuous cellular automaton you're

30:27

pretty much in the same boat as the end

30:29

body problem

30:31

now a lot of this discussion comes down

30:33

to whether you believe infinity exists

30:36

or not actual infinity this is a teaser

30:39

clip from our conversation with dr

30:41

joshua bach

30:42

can the universe can our actual universe

30:45

that we're in right now

30:47

be actually infinite in spatial extent

30:51

the problem is that you can have

30:52

unboundedness in the sense that you have

30:54

a computation that doesn't stop giving

30:56

you results

30:58

but you cannot take the last result of

31:00

such a computation and go to the next

31:02

step

31:03

you cannot have a computation that

31:05

relies on knowing the last digit of pi

31:07

before it goes to the next step in this

31:09

sense you don't have an infinity but the

31:11

infinities are about the conclusion of

31:13

such a function it means that you

31:14

actually run this function to the end

31:16

and then do something with the result

31:18

unboundedness is different in the sense

31:20

that you will always get something new

31:22

that you didn't expect that you cannot

31:24

predict but it's it's just going on and

31:27

on without this end and it i think it's

31:29

completely conceivable that our universe

31:32

is in this class of systems in the sense

31:34

that it doesn't end

31:35

but

31:36

it doesn't mean that there is anything

31:39

that gives you the result of an infinite

31:40

computation because if that was the case

31:44

then it could not be expressed in any

31:45

language

31:47

it also means if something cannot be

31:48

expressed in any language that you

31:50

cannot actually properly think about it

31:53

because when you think you need to think

31:54

in some kind of language not in english

31:56

but in some kind of language of sort or

31:58

in a mathematical language that doesn't

32:00

have contradictions and what girdle has

32:02

shown is that the language that he hoped

32:04

to reason in about infinities

32:07

breaks that it has contradictions in it

32:10

that at some point it blows blows itself

32:12

apart so the languages that we can build

32:14

are only those in which we have to

32:16

assume that infinities cannot be built

32:18

so infinity in this sense is meaningless

32:21

because we cannot make it in any kind of

32:23

language

32:24

so the thing is though i'm not limiting

32:26

what the universe is capable of based on

32:29

human you know mental and linguistic

32:32

limitations or even mathematical

32:34

limitations like i'm i'm asking you if

32:37

it's possible for this universe that

32:39

we're in to anticly be right now

32:42

actually infinite in spatial extent

32:46

the thing is that you try to make a

32:47

reference to something that you cannot

32:49

observe and cannot conceive of other

32:52

than making a model in some kind of

32:54

language

32:55

and to have that model make sense the

32:57

language needs to work right otherwise

32:59

you are just

33:01

maybe in some kind of delusional thing

33:03

you can't get to infinity from

33:05

non-infinity and you can't get to

33:07

discrete from analog so keith believes

33:09

that there are actual infinities in

33:12

stark contrast to people like stephen

33:14

wolfram but our brains are

33:16

computationally bound we are conducting

33:18

what is a discrete computation in our

33:21

mind but we might have access to oracles

33:24

which is to say we're connected to a

33:25

turing machine but we can only sample at

33:28

a certain rate

33:30

keith believes in infinity therefore

33:32

there may be many strongly emergent

33:33

phenomena because they're not computable

33:36

he therefore doesn't think the universe

33:38

can even run on a computer or indeed

33:40

that we exist inside a simulation

33:44

the simplest way to prove the

33:45

constructivist hypothesis that natural

33:48

systems need to perform computation in

33:50

order to succeed and adapt in respect of

33:53

its environment is to create an

33:56

idealized version of the problem that is

33:58

to say let's simplify it as much as

34:01

possible while still retaining the

34:04

features that make the problem

34:05

interesting and that is exactly what a

34:08

cellular automaton does

34:10

cellular automata are a class of

34:12

computational models that exhibit rich

34:14

dynamics weakly emerging from the local

34:17

interactions of cells arranged on a

34:20

regular lattice for example

34:22

two-dimensional grid

34:24

cellular automata were invented by john

34:27

von neumann back in the 1940s they

34:30

exhibit extremely complex behavior

34:33

that's difficult or impossible to

34:36

predict from the cell update rule

34:38

now melanie mitchell commented in her

34:40

book that this is one of the great

34:42

ironies of computer science

34:44

since cellular automata often referred

34:46

to as non von neumann style

34:49

architectures in contrast with the von

34:51

neumann style architectures

34:53

that he also invented

34:55

von neumann was also able to show that

34:57

his cellular automaton was equivalent to

35:00

a universal turing machine

35:02

and therefore capable of universal

35:04

computation which is to say computing

35:06

anything which a turing machine can

35:09

in 1970 john conway invented his own

35:14

cellular automata called the game of

35:15

life and it had significantly simpler

35:18

update rules than von neumann's version

35:21

the most simple version is on a 2d grid

35:23

with discrete binary values where the

35:26

alive or dead state of every single cell

35:28

depends on its eight neighboring cells

35:32

the rules are as follows

35:33

one

35:34

any live cell with two or three live

35:37

neighbors

35:38

survives

35:41

two

35:42

any dead cell with three live neighbors

35:45

becomes a live cell

35:48

three all other live cells die in the

35:51

next generation similarly all of the

35:54

dead cells

35:55

stay dead

35:56

even though the game of life doesn't

35:58

pretend to be the most sophisticated way

36:00

to understand complex systems they are a

36:03

wonderfully simple way to get acquainted

36:05

in the ideas of complexity science and

36:08

in particular weak emergence

36:11

now many of the patterns are incredibly

36:13

lifelike and that's because these are

36:15

class four automata they are touring

36:18

complete which is to say they're capable

36:20

of representing any computation

36:23

now being weakly emergent doesn't

36:25

preclude useful analysis i mean for

36:27

example it's still possible to model how

36:30

frequently phenomena like gliders appear

36:32

in the emergent domain given many random

36:35

initializations

36:36

laws governing the weakly emergent

36:38

states almost certainly exist but can

36:41

only be discovered through empirical

36:44

analysis and observation and simulation

36:47

we can identify motifs

36:49

systems behaviors mechanisms

36:53

high level abstractions even in the

36:56

emergent layer but nothing from first

36:59

principles in what sense do natural

37:02

systems compute

37:03

at a very general level one might say

37:05

that computation is what a complex

37:07

system does with information in order to

37:10

succeed or adapt in its environment

37:13

morphogenesis means the generation of

37:17

form

37:18

it's colloquially described in a

37:20

biological process that causes a cell or

37:23

a tissue or an organism to develop its

37:26

shape but in an artificial intelligence

37:28

context we can think of it as meaning

37:30

the blueprint of emergence of any

37:32

physical form

37:34

professor sebastian riese recently wrote

37:37

an article called the future of

37:39

artificial intelligence is

37:40

self-organizing and self-assembling and

37:43

before you ask yes we'll be inviting him

37:46

to mlst

37:47

he spoke of a current movement which

37:49

combines ideas from deep learning with

37:51

ideas from self-organization and

37:53

collective systems it's a wonderful tree

37:56

ties for emergentist open-ended and

37:58

biologically inspired ai enthusiasts

38:01

searching for parameters of

38:03

self-organizing systems which produce

38:05

particular patterns is a difficult

38:07

optimization problem

38:09

trying to make self-organization

38:11

programmable is a research field of its

38:13

own called morphogenetic engineering he

38:17

said that the merger of these ideas

38:19

could ultimately allow our ai systems to

38:22

escape their current limitations such as

38:24

being brittle and rigid and not being

38:26

able to deal with novel situations

38:29

however the combination of these methods

38:31

also poses new challenges and requires

38:33

novel ways of training to work as

38:35

efficiently as possible

38:38

risi said that one of the most

38:39

fascinating aspects of nature is that

38:41

groups with millions or even trillions

38:43

of elements can self-assemble into

38:46

complex forms based only on local

38:48

interactions and display what is called

38:51

a collective type of intelligence

38:54

sebastian gave the example of ants which

38:57

can join forces to create bridges and

38:59

rafts or navigate difficult terrain

39:02

termites can build nests several meters

39:05

high without an externally imposed plan

39:08

and thousands of bees work together as

39:10

an integrated whole to make accurate

39:12

decisions on when to search for food or

39:15

a new nest

39:17

he said that achieving these incredible

39:19

abilities is a result of following

39:20

relatively simple behavioral rules

39:23

through a process of self-organization

39:26

kamazin

39:27

defined self-organization in 2001 as the

39:31

following

39:32

as a process in which a pattern at the

39:34

global level of a system emerges solely

39:37

from the numerous interactions among

39:39

lower level components of the system

39:41

moreover the rules specifying

39:44

interactions among the systems

39:45

components are executed using only local

39:49

information without reference to the

39:51

global pattern

39:53

in short the pattern is an emergent

39:56

property of the system rather than being

39:58

imposed on the system by an external

40:01

ordering influence

40:03

with the emergence of powerful machine

40:05

learning algorithms sebastian said that

40:07

the key question is instead of hand

40:10

designing the algorithms for

40:12

self-assembly can we learn these

40:14

algorithms instead allowing more complex

40:17

forms to be created

40:19

sebastian said that self-organizing

40:21

systems are made out of many components

40:24

which are highly interconnected the

40:26

absence of any centralized control

40:29

allows them to quickly adjust to new

40:31

stimuli and changing environmental

40:33

conditions additionally because these

40:35

collective intelligence systems are made

40:37

of many simpler individuals they have

40:39

built-in redundancy with a high degree

40:42

of resilience and robustness

40:44

individuals in this collective system

40:46

can fail without the overall system

40:49

breaking down

40:50

sebastian points out that evolution was

40:53

able to exploit self-organizational

40:55

processes to create artifacts of

40:58

remarkable complexity however

41:01

human-made designs are normally put

41:03

together piece by piece this is similar

41:06

to the idea of whether an ai

41:08

architecture and knowledge should be

41:10

human engineered or revolved blank slate

41:13

style such as professor rich sutton

41:16

pointed out in his bitter lesson essay

41:19

the amount of information it takes to

41:21

specify the wiring of a sophisticated

41:23

brain directly is far greater than the

41:26

information stored in the genome instead

41:29

of storing a specific configuration of

41:31

synapses the genome encodes a much

41:34

smaller number of rules that govern how

41:36

to wire up a brain through

41:38

self-organizing processes and how

41:40

synapses should change based on the

41:42

activation of neurons this amazing

41:45

compression has also been called the

41:47

genomic bottleneck

41:49

now when humans engineer bridges or

41:52

teach curricula there's always a plan a

41:55

pedagogy a curriculum

41:58

in biological construction there's no

42:00

blueprint well not one which defines the

42:02

outcome evolution is a kind of meta

42:05

optimizer and our dna is incredibly

42:08

compressed it can't possibly describe

42:10

the complex configuration of our brains

42:14

it's a form of optimization which

42:15

transgresses rungs of the ladder of

42:17

emergence sebastian says that our genes

42:20

contain the information to make the

42:22

structure by controlling a sequence of

42:24

events during morphogenesis

42:26

our final physical form is merely a kind

42:29

of sampled materialization of this lower

42:31

level process this is very similar to

42:34

this concept of inverse diffusion which

42:36

happens in the open ai daily 2 model by

42:38

the way

42:40

now as sebastian says in his article

42:43

deeper neural networks are totally human

42:45

engineered whether it's the architecture

42:47

itself or indeed the optimization

42:50

algorithm which is stochastic gradient

42:51

descent given enough data deep learning

42:54

algorithms can learn to decompose any

42:56

space into a highly sophisticated

42:59

geometrically tessellated nested

43:01

compressed representation

43:03

the problem is that this representation

43:06

is extremely brittle and breaks with

43:09

even minor changes in the environment

43:11

deep learning models efficiently

43:12

compress what they have seen before with

43:15

laser-like effectiveness but the problem

43:17

is that many domains are open-ended and

43:20

combinatorially large and are not

43:22

amenable to memorization in this way

43:24

sebastian argues that using emergence

43:27

and self-organization might help

43:29

robustify neural networks in a similar

43:31

way to how biological systems are robust

43:34

although he conceded that

43:36

self-organization is not the only

43:38

principle that allows biological

43:40

organisms to display high-level

43:42

robustness anyway i highly recommend you

43:44

check out sebastian's article it's

43:46

brilliant

43:47

to follow up a bit on this idea of

43:49

centralized versus decentralized if we

43:52

look at decentralized systems not always

43:55

but very often they sort of

43:58

self-organize into a centralized system

44:00

for example the brain has the sort of

44:02

the prefrontal cortex directing

44:04

everything if we look at humans the

44:07

first thing humans do is they band

44:08

together and they elect a leader right

44:11

um if if we build decentralized

44:13

computing systems there's always like

44:15

one leader and

44:17

so how how much how much do you think

44:19

this the emergence

44:21

of properties such as intelligence or

44:25

whatnot is a property of really

44:27

decentralized computing or how how

44:30

important is this sort of leader

44:32

election among decentralized systems and

44:34

can we do without it

44:37

oh uh yeah i think that's a great

44:38

question again you always ask a great

44:40

question so

44:42

you're right like in many decentralized

44:44

systems like our brain or in

44:47

civilization

44:48

eventually something like a centralized

44:51

system is formed

44:52

and and usually maybe via our genotype

44:56

our genes the same

44:58

centralized system is usually formed

45:01

across

45:02

all humans and in even societal

45:05

structures like this

45:07

typically you have a leader

45:09

or a few leaders and they govern the

45:11

society in a few types of

45:14

ways right

45:16

but but

45:17

i i think the emergence of that

45:20

structure is very important compared to

45:24

uh designing it uh top down at the

45:26

beginning uh let me tell you why uh

45:29

because like take the example of of say

45:32

our bodies or the brain right there

45:34

there are cases like the the the way the

45:38

uh the structure is is emerged may be

45:41

the same for most people but for people

45:44

with certain disabilities of unfortunate

45:47

disabilities from from birth or

45:49

accidents uh

45:51

we're able to see

45:52

brains or structures evolve differently

45:55

but they they still function as a whole

45:58

like like certain certain infants are

46:00

known to

46:01

to have half their brain and like uh

46:04

not functioning at birth and you know

46:07

like the the it has to be removed like

46:10

uh from birth but they still grow into a

46:13

functional brain that has a different

46:15

structure than what what we

46:17

traditionally know for most humans

46:20

and and even for for people with

46:22

disabilities like like blindness or

46:24

death they eventually

46:27

their brain structures would would like

46:30

change functionalities a blind person

46:32

would use their visual cortex to process

46:34

audio for instance so so

46:37

where the emergence property is very

46:39

useful for

46:40

for tackling like changes in the

46:43

environments as i mentioned in the

46:45

beginning so so ultimately the goal is

46:47

to have something that will work even

46:49

when the environment changes but

46:52

it'll work maybe optimally when the

46:55

environment is expected but it's not

46:57

going to completely not work when the

46:59

environment changes

47:01

alexander maude vinsef another guy that

47:03

we definitely need to get on the show

47:05

wrote a fascinating article called

47:07

growing neural cellular automata i've

47:09

been looking into this and essentially

47:10

it's a convolutional or neural network

47:12

type architecture which produces what

47:14

appears to be an rgb

47:16

value for every single pixel but

47:17

actually the output is a 16 channel

47:19

space including a bunch of other

47:21

information they've turned a

47:22

self-healing image generation process

47:24

into an emergent phenomena and so

47:26

they're kind of continuously applying

47:28

this convolutional neural network over

47:29

the um input space much like you would

47:32

do with the traditional cellular

47:33

automata except this one of course is a

47:36

continuous cellular automata which is

47:38

learned with a neural network

47:40

but then it has this incredible thing

47:41

where if you interactively delete

47:43

components of the image or perturb

47:44

components of the image it'll

47:46

dynamically repair itself which is

47:48

fascinating just imagine some of the

47:50

applications for this where you could

47:51

have self-healing systems and you could

47:54

have these agents that

47:55

learn to heal a system as an emergent

47:58

behavior

47:59

so there's this really interesting

48:01

intellectual journey here which starts

48:02

with discrete cellular automata which

48:04

are binary and run on a regular lattice

48:06

which is say a two-dimensional grid and

48:08

then all sorts of interesting things

48:10

happen when we increase the resolution

48:11

or run on different manifolds or have

48:13

continuous values and then even use

48:15

something like a learnable neural

48:17

network for performing the update rules

48:19

dr danielle gratarola is a scientist and

48:22

postdoctoral researcher at epfl he

48:25

recently published a fascinating paper

48:27

called learning graph cellular automata

48:28

which was published in in eurips and in

48:31

that work he focused on a generalized

48:33

version of a typical cellular automata

48:34

called a graph cellular automata in

48:36

which the lattice structure is replaced

48:38

by an arbitrary graph uh in particular

48:41

they extended the previous work which i

48:42

just showed you from alex malvinsef you

48:45

know which was when they they

48:46

learned a 2d convolutional neural

48:49

network for applying um the cellular

48:51

automaton update rule to now using a

48:54

graph neural network and learning the

48:55

update rule on that with message passing

48:57

it's absolutely fascinating so now i

48:59

give you danielle gratarola cool

49:03

right let me get my notes out by the way

49:06

i've i've just been on a crash course in

49:08

cellular automata oh nice

49:10

uh it it is absolutely fascinating yeah

49:14

um i'm completely hooked on it actually

49:17

yeah it is it is fascinating tim i'm

49:19

gonna i i have to share with you i have

49:21

to share with you my little uh

49:23

cellular tama that that tries to do um

49:26

you know uh

49:27

light casting or shadow casting

49:29

roguelike roguelike games oh nice

49:32

yeah many of those like tiny games like

49:34

even uh i think it's called gnome

49:36

fortress something like that yeah it was

49:38

an old-school linux game uh it's used

49:41

like celero tamato to generate the

49:43

terrain and stuff like that it's super

49:44

fast fascinating

49:46

yeah i played around with with simple

49:47

simple cellular automata quite a bit and

49:50

little hobby

49:51

yeah you know hobby games or simulations

49:53

i mean even the um you know tim that

49:56

that uh galton board simulation in our

49:59

our video that was a solar automata yeah

50:02

i hadn't thought about that of course

50:04

yeah it's fascinating i mean and by the

50:06

way i mean because you linked

50:07

alexander's article um you know he did

50:10

the kind of the the 2d gridded cnn

50:12

version of uh morphogenesis and i mean

50:15

maybe you should just introduce i'll

50:16

tell you what

50:17

we're we're doing this all wrong uh

50:19

daniel why don't you introduce all right

50:21

right so uh yeah

50:23

so my name is daniel i am currently i

50:26

just graduated actually from idcia in

50:28

lugano so i'm currently working

50:30

at epfl in lausanne so i moved to the

50:33

french-speaking part of switzerland

50:36

and

50:37

so right now i'm working in the domain

50:39

of proteins

50:41

and my formal training during my phd was

50:43

in graph neural networks and

50:45

at some point i reached out to

50:48

my current

50:50

let's say supervisors or pi that were

50:53

starting out this project on applying

50:55

graph neural networks to the protein

50:58

domain in particular protein design

50:59

which is like

51:00

essentially the inverse problem to alpha

51:02

fold if you've heard about alpha fold

51:04

recently so alpha false goes from the

51:06

sequence of amino acids to the folded

51:08

structure and one still open and very

51:11

interesting problem is so how to do the

51:13

opposite so if i want a particular

51:15

structure what is the sequence that

51:16

would fall into that structure right and

51:19

you would think that having solved one

51:21

direction would essentially means you've

51:22

solved the other but it's still com

51:24

computationally expensive to go over all

51:26

possible sequence and try and see if

51:28

they fall in the correct state and so

51:30

like um there's still like this open

51:32

question of uh whether the structure of

51:35

a folded protein somehow informs uh the

51:39

sequence and as you can if you can

51:40

predict one from the other uh and so i'm

51:42

working in that whole domain

51:45

uh right now but as i said like my

51:47

background is in graph neural networks

51:49

uh during my phd i've worked on a

51:52

thousand different things related to

51:54

graph neural networks and by the way i

51:56

started like 2017 i started my bhd so it

51:59

was still at the time where graph neural

52:01

networks were starting to emerge a

52:04

little bit so there was like this

52:06

feeding frenzy of you know finding

52:08

applications and trying to see if stuff

52:10

worked which was a really exciting time

52:11

to be in graph neural networks i should

52:13

say um and then like uh at some point

52:16

during my phd towards the end i

52:20

i decided to link back to one of my

52:22

oldest passions which was this idea of

52:25

the cellular automata

52:26

and and trying to see if some of the

52:28

tools that i have been working on had

52:31

been working on would actually be useful

52:33

to to say something about that whole

52:35

world and it turned out it did so yeah

52:39

yeah well i i mean i'm so inspired by

52:42

geometric deep learning after i spoke

52:44

with michael bronstein and and his

52:46

friends um but yeah i mean so much of

52:49

the work that we've been brought up on

52:50

is is uh

52:52

euclidean or gridded data and then when

52:55

you start to think about some of the

52:56

applications that you can do with graphs

52:58

and and you know curved surfaces and so

53:00

on it blows my mind but before we get

53:03

there why don't we go on a kind of

53:05

intellectual journey here and start

53:06

talking about cellular automata now

53:08

anyone who's had the misfortune of doing

53:10

leeco challenges in the tech industry

53:13

probably would have had to implement

53:15

conway's game of life at some point and

53:17

um usually the way you know these

53:19

challenges are formulated is and they

53:22

are binary which means the cells are one

53:24

or zero

53:26

and it's on a regular lattice usually a

53:28

2d grid and you have a whole bunch of

53:30

update rules which are a function of the

53:32

neighboring cells and then you just kind

53:34

of execute all of these rules and you

53:36

just get this emergent phenomena happen

53:39

when you zoom out it's fascinating so

53:41

can you just tell us a little bit about

53:42

about cellular yeah sure so basically

53:44

the

53:45

the short story is what you just said so

53:47

you have this uh essentially it's a

53:49

computer program or a computational

53:50

model that has a state

53:52

and typically the status what you said

53:54

it's just a bunch of cells arranged in

53:56

these regular structures which can be

53:58

you know 1d or 2d or even 3d or whatever

54:02

and and then every cell has a particular

54:04

state of its own and then you have this

54:06

transition rule or update functions

54:08

however you want to call it that

54:11

is applied synchronously to every cell

54:12

and essentially decide what the next

54:15

state of the cell will be as a function

54:16

of the cell itself and the neighbors um

54:19

and really the cool thing that you find

54:21

is that even though like the complexity

54:24

at the level of the rule is fairly low

54:27

so you have pretty simple rules that you

54:29

can define um you know the behavior that

54:32

emerges can be like very life like like

54:35

the the tiny creatures that you see

54:38

emerging on this on these grids uh

54:41

really

54:42

you know they kind of click with with

54:44

our pattern matching system as humans

54:46

because they they look like uh tiny

54:49

creatures moving around the grid they're

54:50

able to spawn new creatures they're

54:53

they're they're able to you know move

54:55

coherently and they add periodicity over

54:58

time and and so it's either living

55:00

things or or engineered things there

55:02

they have the same that kind of

55:03

regularity that we that we recognize as

55:06

interesting um

55:08

and that's like the just the basic

55:10

version but then

55:12

with time people have started to

55:14

complicate the definition of cellular

55:16

automata right so for example instead of

55:19

you know binary you can ask the question

55:21

of okay what happens if i allow the

55:22

states to be

55:24

n and possible states over the grid so

55:26

and i can color the states differently

55:29

or i can ask you i can ask what happens

55:31

if the state is continuous right

55:34

and as you start doing that what you see

55:36

is that uh the the behavior becomes more

55:40

and more complex in a sense even though

55:43

uh let's say the common god of

55:44

complexity at the level of the rule

55:46

remains fairly low as you start

55:48

introducing just that tiny bit more of

55:50

complication you see this insanely

55:52

complicated patterns that emerge as a

55:55

result and so for example at some point

55:57

people started uh let's say playing with

56:00

the definition of the neighborhood right

56:02

so you make it a bit a bit larger so

56:04

which is equivalent to increasing the

56:06

resolution right so your your grid

56:08

approximation which if you think about

56:11

it like a grid is just a discretization

56:13

of 3d space or 2d space right but at the

56:16

same time we are like as humans we are

56:19

very far from that kind of level of

56:21

discretization of space if it even

56:23

exists right so we're we're used to

56:24

thinking about high resolution in a

56:26

sense and so what you what you observe

56:28

if you start to increase the resolution

56:30

of these models is that their behavior

56:33

starts to become you know eeriely like

56:35

living things and so you see like tiny

56:38

cells forming and moving around and then

56:40

they start to organize into membranes

56:43

and stuff like that and this all happens

56:46

by that same convolution like process

56:48

that's happening on this grid

56:50

and and that's why i think they're so

56:52

fascinating you know leading back also

56:54

to your comment before like they have

56:56

this

56:58

they let you observe

57:00

behaviors that typically you only see in

57:02

nature but at the same time you are

57:04

aware of this

57:06

inherent simplicity that the behavior

57:08

stems from

57:09

and uh and so i'm already like kind of

57:11

diverging because this topic like

57:13

automatically makes me go on rants of

57:15

how these things are super simple and

57:18

yet super complicated and super

57:19

fascinating

57:23

maybe maybe um

57:25

just playing devil's advocate here

57:27

because i i too love solar automatize we

57:29

were talking about before we started the

57:31

show

57:31

but just to perhaps pull things back to

57:34

some grounding here which is that uh

57:36

in a way folks working on cellular

57:38

automata have converged in some ways to

57:41

a very old

57:43

set of numerical techniques called

57:45

finite difference

57:46

you know modeling right so and

57:49

the way what engineers do with finite

57:51

difference is they say okay look i have

57:52

this set of partial differential

57:54

equations right and as we know

57:56

tons of things in the world physical

57:58

phenomena can be described by pdes

58:01

partial differential equations and they

58:02

say

58:03

okay can't solve these symbolically so

58:06

but i can do it numerically if i have a

58:08

grid then i can start to write down

58:10

how the pdes you know result in changing

58:13

continuous values based on kind of

58:15

neighboring grid cells and they do this

58:17

exact thing they create a mesh

58:19

they uh write down what uh what

58:21

transition rules the pdes would would

58:23

imply for each individual cell

58:26

and then you run simulations and so you

58:28

wind up with things like

58:29

you know uh

58:31

the equivalent of cellular automata with

58:33

continuous values for the wave equation

58:35

or for diffusion equations or for all

58:38

this kind of thing and so in one sense

58:40

it shouldn't surprise us that

58:42

cellular automata can reproduce all the

58:45

behaviors that we see

58:47

in life because indeed the majority of

58:49

that or all of it you know stems from

58:52

partial differential equations at some

58:54

level and we know that we can

58:56

approximate those solutions

58:59

with cellular automata via the you know

59:01

finite difference route

59:03

um but at the same time

59:05

it feels it definitely feels mysterious

59:08

and i think there is something

59:09

something deep there and this even goes

59:11

back to say mandelbrot right with his

59:13

discovery of

59:15

of fractals i mean what the heck i just

59:17

had this simple little

59:18

quadratic equation in complex space and

59:22

if i just iterate that map over and over

59:24

again i wind up with this absurdly

59:27

complex you know in a sense like

59:28

infinitely complex

59:30

you know boundary and and interesting

59:32

connections

59:33

so

59:34

there's these kind of two opposing

59:36

viewpoints i wonder how you how you

59:38

reconcile those like on the one hand it

59:40

seems very

59:41

interesting and mysterious and yet on

59:43

the other hand it seems like of course

59:45

if we go to a high enough resolution we

59:47

can simulate arbitrary differential

59:49

equations i think it's like the i don't

59:52

know if it's an answer but one possible

59:54

explanation of this apparent dichotomy

59:56

is uh it's a matter of scale right so if

1:00:00

you go low enough with the scale and by

1:00:02

low i mean you know modeling uh the low

1:00:05

level physics in a sense uh

1:00:08

you probably get to the point where the

1:00:10

skill is so low that everything makes

1:00:12

sense to be modeled as a continuous

1:00:14

differential equation right

1:00:16

and so at some point you know cellular

1:00:18

automata or a set of pdes what's the

1:00:21

difference it's not even that well

1:00:23

defined like it's like a sort of

1:00:25

spectrum that you can decide where you

1:00:26

want to place yourself in um

1:00:29

what is interesting though is that i

1:00:30

think that

1:00:32

this idea of locality

1:00:34

and and having you know update rules or

1:00:36

transition rules or whatever you know

1:00:38

execution kind of engine you want to

1:00:40

have

1:00:41

for your inherent program

1:00:43

at that point it

1:00:45

it becomes

1:00:47

as you go up in the abstraction

1:00:48

hierarchy it just makes sense to

1:00:51

consider your elements yourselves as

1:00:53

discrete objects and then this is maybe

1:00:56

not true if you are if you're modeling

1:00:58

for example the flow of some some water

1:01:01

or whatever for example i had this

1:01:02

professor uh when i was at the

1:01:05

during the bachelor that he was using

1:01:07

cellular automata to model how water

1:01:10

moves in like inside coffee for example

1:01:13

right and and then you can you can then

1:01:15

you can ask the question of okay is it a

1:01:17

cellular automata should i be using some

1:01:20

something else that is actually

1:01:21

continuous but what i think is really

1:01:24

fascinating about the idea at least of

1:01:27

cas is that as you go up in the

1:01:29

hierarchy then it makes more and more

1:01:31

sense to think about you know discrete

1:01:33

agents interacting according to some

1:01:35

rules and at that point the continuum

1:01:38

like kind of gets lost anyway or at

1:01:40

least it gets lost in the way you want

1:01:42

to model it right so if you're modeling

1:01:44

you know again low-level physics it

1:01:46

makes sense to be working with a grid

1:01:48

but if you're you know working out

1:01:50

modeling human interaction for example

1:01:52

which you can probably still

1:01:54

model fairly well as a sort of local

1:01:57

kind of dynamical system

1:01:59

then it doesn't make sense to model

1:02:00

humans as living on a continuous trade

1:02:02

well no you kind of want to model them

1:02:04

as individual

1:02:06

objects in a sense right

1:02:09

yeah what's what's interesting to me is

1:02:12

as as you're bringing up so you were

1:02:14

going in in this direction of

1:02:16

um

1:02:18

if we're at a very low level it might

1:02:19

make sense to think of of a continuum

1:02:22

but then at some level of abstraction

1:02:24

uh things really behave as these

1:02:26

discrete

1:02:27

you know objects or say in the case of

1:02:29

of carl fristen you know a markov

1:02:31

boundary a thing that has this kind of

1:02:34

stochastic dynamic

1:02:36

you know markup boundary yet it behaves

1:02:38

as a unified you know whole um

1:02:41

and and what's odd is that

1:02:44

neither at the highest scale nor the

1:02:46

lower scale

1:02:47

does either continuity or discrete

1:02:50

nature ever disappear it just seems to

1:02:52

be continuously

1:02:54

i shouldn't have said continuously it

1:02:56

just seems to be forever intertwined you

1:02:58

know that okay if i keep going down in

1:03:00

this direction i get to a continuum but

1:03:02

maybe if i go even deeper i get back to

1:03:04

some discrete you know hypergraph or if

1:03:07

i'm going in the opposite direction i

1:03:09

get up to say the discrete level of

1:03:11

molecules but if i keep going it starts

1:03:13

to behave as a continuous fluid if i go

1:03:15

further it starts to behave as a

1:03:17

discrete cell if i go further than that

1:03:19

it's a you know you keep interleaving

1:03:22

back and forth between discrete being

1:03:24

the correct level of analysis versus

1:03:27

continuous being the correct level

1:03:29

analysis that's kind of the mystery is

1:03:30

that they're they don't exist at either

1:03:32

extreme they just are constantly

1:03:34

interleaved that's the real cool thing

1:03:36

that

1:03:36

it's like it appears very arbitrary that

1:03:39

we as humans at some point decide no

1:03:41

this is like i i recognize this as a

1:03:44

layer of of this abstraction it's like

1:03:47

you know i i can

1:03:49

pretty clearly distinguish between being

1:03:51

at the layer of atoms and being at

1:03:53

layers of cells although if you look

1:03:56

close enough then cells are composed of

1:03:58

proteins and proteins and composites of

1:04:00

atoms so you can kind of always go back

1:04:02

uh but at some point there's there's

1:04:04

also this kind of uh

1:04:06

limit uh that defines um or that decides

1:04:11

how far can a layer kind of communicate

1:04:13

with the other layers right so we as

1:04:15

humans we have no agency to interact

1:04:18

with atoms although we are made of atoms

1:04:20

but we have kind of essentially zero

1:04:22

ability to interact with that layer and

1:04:24

so it's like there is a sort of

1:04:26

intrinsic boundary that lets you operate

1:04:29

on some levels of these obstructions and

1:04:31

these levels appear to be fairly close

1:04:33

to one another so i might be able to

1:04:34

influence the level above me and below

1:04:37

me which might be in i don't know if we

1:04:39

want to look at some discretization

1:04:40

maybe i can act on my organs and i can

1:04:43

act on society right one level that one

1:04:45

level up but already i cannot act on my

1:04:48

proteins right or or my individual cells

1:04:50

it's gonna be much much harder uh and as

1:04:53

you go down in the hierarchy and of

1:04:55

course up in the hierarchy the

1:04:56

contribution of that particular layer

1:04:58

becomes less and less relevant right so

1:05:00

it's like it you you're definitely able

1:05:03

uh

1:05:04

to recognize those boundaries or like i

1:05:06

don't know if you can give a precise

1:05:08

definition but there definitely appears

1:05:10

to be some level of

1:05:12

discreteness uh or at least some ranges

1:05:15

where it makes sense to talk about a

1:05:17

level of abstraction that stands on its

1:05:19

own i would say

1:05:21

yeah i'm really interested actually that

1:05:22

there's a kind of observer relative

1:05:24

problem that you know depending on the

1:05:25

ladder of the um

1:05:28

let's call it an emergence ladder we're

1:05:30

on a rung of the emergence ladder and

1:05:31

maybe that determines how we can

1:05:33

formalize and understand phenomena on

1:05:35

different rungs of the emergent ladder

1:05:37

but just to pull the discussion back a

1:05:39

tiny bit so um this is all quite new to

1:05:40

me and i'm fascinated by it i've

1:05:42

actually just started reading a new kind

1:05:44

of science by wolfram uh inspired by all

1:05:47

the links that that you sent us and um

1:05:49

you know one of the one of the first

1:05:50

things to learn about with cellular

1:05:52

automata is is the basic discrete

1:05:54

one-dimensional version and um wolfram's

1:05:57

actually given all of them names right

1:05:59

because if you think about it in the

1:06:00

one-dimensional discrete cellular

1:06:01

automata you have a neighborhood of

1:06:03

three and then if it's binary you've got

1:06:05

two to the power of three which means

1:06:07

you've got eight patterns and then for

1:06:08

every single pattern it could be one or

1:06:10

zero so you've got two to the power of

1:06:11

eight which is 256 things and and all of

1:06:14

those things you know so for example

1:06:16

there's um rule 110 which he says

1:06:20

exhibits class 4 behavior now this is

1:06:22

interesting as well because i'm

1:06:23

interested in you know did he just pluck

1:06:25

this out of thin air that you can kind

1:06:26

of classify the behavior subjectively of

1:06:28

of phenomena in in the emerging uh

1:06:31

domain

1:06:32

and uh but anyway he said class iv

1:06:34

behavior which is neither completely

1:06:35

random nor completely repetitive

1:06:38

localized structures appear and interact

1:06:40

in various complicated looking ways and

1:06:43

and then there's this guy called matthew

1:06:44

cook who used to work for wolfram and

1:06:46

and he said these structures are rich

1:06:48

enough to support universality all right

1:06:50

this result is interesting because rule

1:06:52

110 apparently is is an extremely simple

1:06:56

one-dimensional system and difficult to

1:06:58

engineer the form specific behavior

1:07:00

anyway so i'm reading wolfram's book and

1:07:02

i'm interested like what's he talking

1:07:03

about you know universal communication

1:07:05

and um he he has he has this wonderful

1:07:07

image where he says oh you know look um

1:07:09

here are the occurrences of

1:07:11

progressively longer blocks than the

1:07:12

pattern generated by rule 30 starting

1:07:14

from a single black cell and as far as

1:07:17

he could tell all of the possible

1:07:18

eventual blocks will appear potentially

1:07:21

letting the pattern serve as a kind of

1:07:23

directory of all possible computations

1:07:26

and that was kind of like his argument

1:07:27

about the the uh touring universality so

1:07:30

what's your take on that uh yeah so

1:07:32

they're definitely fascinating objects

1:07:33

in that regard meaning that so i think

1:07:35

that for rule 110 in particular the

1:07:38

argument there is that you can build

1:07:39

logic gates essentially with them

1:07:41

because you kind of have this and i

1:07:42

might be messing up with the specific uh

1:07:45

you know one of the 256 ones but like at

1:07:48

some point you're you're able to uh

1:07:51

shoot this kind of race in one direction

1:07:53

and another in another direction and at

1:07:55

some point if they interact uh the rays

1:07:57

disappear and if they don't interact uh

1:07:59

the array goes on and so it's like a

1:08:01

zero and a one depending on if the rays

1:08:03

survive or dies um and so like

1:08:06

all the arguments for universality of

1:08:08

these models by the way are not

1:08:10

arguments for their efficiency in doing

1:08:13

computation they're just like you know

1:08:15

showing equivalence

1:08:16

is that you can essentially build the

1:08:19

basic machinery that you would need to

1:08:21

perform computation which is like basic

1:08:23

manipulation like the nand gate and

1:08:25

stuff like that and i think that the

1:08:27

formal proof of computation actually uh

1:08:29

goes in a completely different direction

1:08:31

with a different computational model but

1:08:32

like the general idea is that one right

1:08:34

you can simulate a turing machine just

1:08:36

by encoding the various rules in

1:08:39

essentially the state and that's a very

1:08:41

fascinating thing that i've been

1:08:42

thinking about a lot recently because

1:08:45

uh what's what we see and and much of

1:08:47

the things we can do with cellular

1:08:48

automata

1:08:50

are not necessarily uh given by the rule

1:08:53

itself so the rule is always simple and

1:08:56

in fact uh it's not necessarily new in a

1:08:58

new kind of science but i think in the

1:09:00

next work by wolfram which is the

1:09:02

wolfram physics project uh like he kind

1:09:05

of makes this argument that uh the rules

1:09:08

that govern the universal cellular

1:09:10

automata should be fairly simple right

1:09:13

um and so like there is this bias

1:09:15

towards simple rules but the complexity

1:09:17

that we typically observe comes from the

1:09:20

configuration of the states right and so

1:09:23

all of the computation that you might

1:09:24

want to to do with the cellular automata

1:09:27

comes from configuring the state in the

1:09:29

correct way in fact if you google it up

1:09:32

it should should be fairly easy to find

1:09:34

at some point people uh had this

1:09:37

challenge on stack overflow of

1:09:38

implementing a functional clock in the

1:09:41

game of life as it turns out you can't

1:09:44

implement the functional clock in the

1:09:45

game of life you just need to configure

1:09:47

the states in a particularly smart way

1:09:49

and the state in the states will evolve

1:09:51

on their own and they will create digits

1:09:54

and then change the digits according to

1:09:55

the time once uh every second and so on

1:09:58

uh and so this is like this is what i

1:10:00

find fascinating about the kind of

1:10:02

computation that cas do right because

1:10:04

you can prove that they are universal

1:10:06

because you can do basic operations with

1:10:08

them uh but then much of the complexity

1:10:11

that you can actually observe comes from

1:10:14

the actual states that you have to

1:10:16

configure and that of course is by no

1:10:17

means trivial which is also why people

1:10:20

haven't been using you know cas to

1:10:22

implement computers you use different

1:10:24

architectures and computational models

1:10:27

yeah and and to that point and by the

1:10:29

way so the cook proved rule 110 you know

1:10:32

turning complete by mapping it to

1:10:34

another turing complete system like the

1:10:36

cyclic tag systems

1:10:38

or something i think it was and then and

1:10:40

i think there's only one other rule that

1:10:42

might be

1:10:43

turing complete but it hasn't been

1:10:45

proven you know one way or the other

1:10:46

like rule 30

1:10:48

may or may not be touring complete i

1:10:49

don't think this is quite fascinating

1:10:51

right just this little

1:10:53

simple set of rules and maybe the

1:10:55

simplest turing complete system out

1:10:56

there but as you were just saying the

1:10:58

difficulty lies in going from

1:11:01

a simple set of rules and some complex

1:11:04

initial conditions to then being able to

1:11:07

really predict

1:11:08

what the large-scale behavior is going

1:11:10

to be and i think wolfram you know

1:11:12

points us out himself

1:11:14

which is that um

1:11:16

you know he he has this concept of

1:11:17

computational irreducibility which which

1:11:20

essentially says

1:11:21

look uh predicting what this computation

1:11:24

is going to do

1:11:25

is just as hard as actually running the

1:11:27

computation so there's no shortcuts in a

1:11:29

sense you can't you know and it's

1:11:30

related to to you know

1:11:33

turning completeness you know as well or

1:11:34

rather rather the uh you know the

1:11:37

halting problem which is essentially a

1:11:39

similar kind of problem it says that

1:11:41

trying to compute whether or not a

1:11:42

turing machine an arbitrary turing

1:11:44

machine will halt is just as difficult

1:11:46

as running it itself and therefore you

1:11:48

can't yeah you can't do it without

1:11:50

halting or without failing to halt that

1:11:52

sort of thing um so my question to you

1:11:55

is and this is kind of this emergence

1:11:56

question is

1:11:58

is this just an impossible barrier so in

1:12:00

other words is it the case that you know

1:12:03

something in physical reality runs

1:12:06

runs things you know whether you believe

1:12:08

it's a computation or not whatever

1:12:10

there's some substrate that's executing

1:12:12

this uh you know this this automata of

1:12:15

the universe okay and it just it

1:12:18

displays all this multi-scale behavior

1:12:20

and so you get these emergent you know

1:12:22

things happening human beings planets

1:12:25

you know uh super clusters in the galaxy

1:12:27

whatever

1:12:28

is it

1:12:29

even possible in any

1:12:32

in any sense to predict from

1:12:35

lower levels higher level

1:12:37

emergent behavior or is there just this

1:12:39

barrier

1:12:40

that in a sense this irreducible

1:12:42

complexity that we there's no shortcuts

1:12:44

we can't actually predict

1:12:46

a higher layer of emergence or

1:12:48

abstraction from a lower layer one

1:12:50

without just running the universe itself

1:12:52

a very interesting question and i don't

1:12:54

think i'm really equipped to answer that

1:12:57

without making anybody angry i would say

1:12:59

so that there's a lot of speculation

1:13:01

that you can do

1:13:02

uh

1:13:04

don't worry i've made people angry by

1:13:05

just asking a question so yeah so

1:13:08

what i can say is that so first of all

1:13:11

like we were saying before there seems

1:13:13

to be some some degree of

1:13:16

communication or or ability to predict

1:13:18

what the layer above or below you will

1:13:20

do right so if you are let's say

1:13:22

configuring a cellular automata if we

1:13:24

accept that that is uh how the universe

1:13:26

runs so if you're you're trying to

1:13:28

configure or or to study uh cellular

1:13:31

attack at a particular level you might

1:13:33

have some intuition a priori but what

1:13:35

they will do right so it is possible to

1:13:37

engineer an emergent system if you are

1:13:40

you know even without you know running

1:13:42

it necessarily but you probably can come

1:13:44

up with some smart rules that have a

1:13:46

desired behavior that you might want to

1:13:47

have now it's a much more it's a much

1:13:50

harder question to say

1:13:52

can we build a particular cellular

1:13:55

automata that acts like we see in the

1:13:58

universe and and that's like

1:14:01

because that requires uh us to answer

1:14:03

the question of what are we actually

1:14:04

trying to model and at what scale are we

1:14:07

trying to model the physical reality are

1:14:08

we trying to model you know a brain or a

1:14:11

network of humans right um and and that

1:14:14

i guess uh you can also make that

1:14:16

irreducibility argument for intelligence

1:14:18

in general right so do i necessarily

1:14:21

need to model the brain in order to have

1:14:23

intelligence or can i just approximate

1:14:25

intelligent behaviors and and maybe just

1:14:28

train a neural network to do that right

1:14:30

so i think it's a much more profound

1:14:32

question than just what is the cellular

1:14:34

summary doing and how do i reproduce

1:14:36

that in a computer um it's it's a

1:14:38

question of about like the nature of

1:14:40

reality itself and and whether it's the

1:14:43

only possible way to obtain a particular

1:14:45

computation is to simulate it starting

1:14:47

from the lowest possible level now we

1:14:49

have some evidence that this is not

1:14:51

necessarily the case like we're having

1:14:53

some uh some you know models of

1:14:56

computation that are able to emulate

1:14:58

some of the phenomenas we see right um

1:15:01

and so i guess this is you know it gives

1:15:04

us some kind of hope that

1:15:06

we

1:15:07

might be able to design one such system

1:15:10

and people for example have been started

1:15:12

to using

1:15:13

machine learning to try and design

1:15:15

cellular or someone that do a particular

1:15:17

thing right

1:15:19

so there might be

1:15:21

some degree of approximation that we can

1:15:23

achieve without necessarily computing

1:15:26

everything starting from the lower level

1:15:27

and this is in a sense of course

1:15:30

wolfram's uh physics program i think he

1:15:33

calls it is all about

1:15:35

can we start

1:15:36

at the lowest

1:15:38

possible and i mean like finest scale

1:15:41

you know i don't even know 10 to the

1:15:43

minus 100 meters or something uh

1:15:46

you know substrate in the form of this

1:15:48

this hyper graph and then and then

1:15:50

with these simple rules does the

1:15:52

universe as we know it

1:15:54

you know emerge from that at least on

1:15:56

that that seems to be the uh

1:15:58

you know the case and i mean it or

1:16:00

rather that's that's the that's his

1:16:02

program and

1:16:04

could be could be possible um i think

1:16:06

there's so many open questions there and

1:16:08

of course it's a very active area of

1:16:10

research and almost a new branch of

1:16:13

of mathematics too and i or physics at

1:16:15

least and i think um wolfram himself

1:16:17

said if it can do if it can do these

1:16:19

predictions like for example if we can

1:16:21

derive general relativity or you know

1:16:23

quantum mechanics it's it's at least a

1:16:25

century yeah a century out so

1:16:28

you know we have a while to wait but i'm

1:16:30

curious what you think about

1:16:32

the possibility of that so if it if we

1:16:34

have this interleaved so here's a

1:16:35

question we talked earlier about the

1:16:37

interleaved discrete and continuous you

1:16:39

know that as you move along kind of

1:16:41

scales of emergence or reduction you

1:16:43

keep coming across

1:16:44

the need to either view things as a

1:16:46

continuum or is a is a discrete you know

1:16:49

spectrum of something and so it's like

1:16:51

this alternating series you know in math

1:16:53

that we learned that never converges

1:16:54

right it's plus one minus one it never

1:16:56

converges well if you go to zero so if

1:16:59

you go to that end of infinity all the

1:17:01

way down to the smallest possible scale

1:17:04

do you think we arrive at a discrete

1:17:07

system like a hypergraph like like

1:17:09

wolfram's envisioning or is zero

1:17:12

actually a continuum i'm curious what

1:17:14

you think

1:17:15

that answer is and and what you think

1:17:17

about uh wolfram's paradigm of right so

1:17:21

i think that i was reading about this

1:17:23

some time ago and

1:17:25

the question of whether at the lowest

1:17:27

possible level you actually can see

1:17:29

something like a cell and that kind of

1:17:32

discreteness to it i think it's still an

1:17:34

open question in physics

1:17:36

yeah exactly the atom of space like

1:17:38

that's probably from what i understand

1:17:41

it's still an entirely open question in

1:17:44

physics like they haven't been able to

1:17:46

answer that uh and and the question

1:17:48

there would be like can we actually

1:17:50

discretize the notion of space and the

1:17:52

notion of time because that would be an

1:17:55

answer answering yes to that question

1:17:56

would be a fairly strong argument for

1:17:59

wolf from theory of you know the

1:18:01

universe being this huge l system that's

1:18:04

constantly

1:18:05

rewriting itself right um

1:18:08

but of course it's it's difficult to say

1:18:10

like and at some point one should even

1:18:12

ask a question of whether

1:18:14

for us it's even important to be going

1:18:17

at that particular level which is what

1:18:18

you were asking before like do we

1:18:20

necessarily need to answer the question

1:18:22

of whether the universe is continuous to

1:18:24

be doing interesting things and then

1:18:26

then it becomes like a matter of goals

1:18:27

so

1:18:28

personally i find it fascinating to be

1:18:31

talking about all this localized

1:18:33

emerging computation because i see it as

1:18:35

a potential path forward towards agi for

1:18:38

example right um and and and the

1:18:40

question there at that point becomes can

1:18:42

we achieve something like that without

1:18:46

necessarily needing to go and simulate

1:18:48

the whole universe just to get you know

1:18:50

you simulate this huge

1:18:52

environment just that maybe it will

1:18:54

develop intelligence that seems insanely

1:18:57

costly to do for achieving something

1:18:59

that we can describe fairly well

1:19:02

um and so i i don't know really if at

1:19:04

some point it will become obvious or

1:19:07

people will be able to answer the

1:19:08

question of whether the universe is

1:19:10

continuous

1:19:12

which would probably discredit the

1:19:13

cellular automata theory

1:19:15

uh but i think it's interesting that

1:19:18

this idea of cellular automata

1:19:20

especially how you know wolfram has

1:19:22

instantiated it in one particular way

1:19:24

but the general paradigm is much more

1:19:26

flexible in a sense um

1:19:29

it's interesting that we can describe

1:19:31

things with this model and you know

1:19:35

whatever the level we decide to start at

1:19:38

it we also know that if we set the rules

1:19:42

right then we will be able to observe

1:19:43

the same kinds of emergence and so it

1:19:46

becomes kind of arbitrary to for us to

1:19:48

decide where do we start simulating the

1:19:50

the universe or the system we're trying

1:19:52

to simulate right

1:19:54

yeah

1:19:56

i mean

1:19:56

there are so many things to unpack here

1:19:58

i find that's absolutely fascinating you

1:20:00

know so you know how does our universe

1:20:02

work and you know wolfram was kind of

1:20:05

making the point that underneath all of

1:20:06

this richness and complexity that we see

1:20:08

in physics they could just be really

1:20:10

simple rules

1:20:12

so is the universe an emergent

1:20:14

phenomenon and it kind of see i mean

1:20:16

that's it's very subjective right it's

1:20:17

very vague it seems like it is because

1:20:20

when you recreate so many of these

1:20:22

emergent systems they produce phenomena

1:20:24

that look a lot like the universe right

1:20:27

but then there's this notion of well

1:20:29

could we find the exact simple rules and

1:20:31

the exact representation to create

1:20:33

something like the universe and then

1:20:34

there's this notion of irreducibility

1:20:36

and then it becomes very very vague but

1:20:38

what's fascinating though is just by

1:20:40

applying the the same rules over and

1:20:42

over again you can produce something

1:20:44

that looks really really complicated and

1:20:46

that's just not what our intuition tells

1:20:48

us at all

1:20:49

yeah that's true and i think like i just

1:20:51

had this uh you know kind of follow up

1:20:53

to to the discussion which is this uh

1:20:56

idea that at some point

1:20:59

you're interested in understanding the

1:21:01

universe at some particular scale right

1:21:03

so you you might be interested in

1:21:04

understanding intelligent systems or you

1:21:06

know just living system if you want to

1:21:08

be at one level lower and so at some

1:21:10

point the questions you need to be

1:21:11

asking it goes it goes back to what we

1:21:14

were saying before right you if you if

1:21:16

you're interested in a particular level

1:21:18

you don't necessarily need to go all the

1:21:20

way down and start there you might just

1:21:22

go one level lower and start modeling

1:21:24

things there and know that you maybe

1:21:26

maybe you will introduce some

1:21:27

approximation errors but if you do

1:21:29

things well enough then you will kind of

1:21:31

see that emergence and you can build on

1:21:32

top of that layer of player after layer

1:21:34

right and and and i agree that it is

1:21:36

fascinating that this kind of emergence

1:21:39

appears to be like a sort of constant

1:21:42

throughout the different layers right so

1:21:44

you it doesn't it doesn't really matter

1:21:47

the specific rules that are acting at a

1:21:49

particular layer right it what matters

1:21:51

is that the same kind of computational

1:21:54

engine appears to be working at every

1:21:55

layer and so you might have the similar

1:21:58

phenomena happening at the physics level

1:22:00

or at the cell level or at the society

1:22:02

level and the rules will change and in

1:22:05

fact michael actually makes this very

1:22:07

interesting argument about

1:22:10

different layers being recognizable by

1:22:13

the kind of goals they're trying to

1:22:15

solve right and so for example you might

1:22:17

recognize the a layer the layer of

1:22:21

society because it's

1:22:22

trying to solve the goal i don't know of

1:22:24

of surviving as a species for example um

1:22:27

and the rules that you will find at that

1:22:29

layer will be in a sense

1:22:32

emerging to solve that particular goal

1:22:35

exactly like i don't know in a very

1:22:37

similar simple level atoms will have

1:22:40

very simple rules that just try to

1:22:42

satisfy some electrical or physical

1:22:44

constraints right and so as you move up

1:22:47

and down you will find different rules

1:22:49

but the same computational principle so

1:22:51

i will have a rule that tries to solve

1:22:53

an objective through localized

1:22:54

computation and and that is what i

1:22:56

really find fascinating about cas and

1:22:58

and just the general idea of of this

1:23:00

kind of models because they appear to be

1:23:04

reasonable to explain different layers

1:23:06

in this architecture

1:23:08

and so this is really interesting to me

1:23:10

so so i mean this is getting to um

1:23:12

something we were just previously

1:23:14

talking about with a with our other

1:23:15

guests about um formalizing what happens

1:23:18

in that emergent space and actually when

1:23:20

we speak with ai alignment people they

1:23:22

bring up asimov's laws and you can get

1:23:24

into you know utilitarianism versus

1:23:26

deontological

1:23:27

but um

1:23:28

you know the thing is even because we're

1:23:30

gonna get on to your work when we're

1:23:32

talking about morphogenesis and what's

1:23:34

fascinating there is that actually you

1:23:36

almost want to um evaluate the rules

1:23:39

that you're creating based on the

1:23:41

emergent phenomena and then there's this

1:23:42

thing about how do i how do i formalize

1:23:45

the nature of that phenomenon i mean if

1:23:46

i was steve stephen wolfram for example

1:23:49

how would i formalize universe like

1:23:52

behavior right oh this thing's emerging

1:23:54

and it looks like the uni looks like the

1:23:56

universe how do i formalize that

1:23:58

so yeah i think what you're describing

1:24:00

is

1:24:01

a property that we might find in

1:24:03

different aspects of life right once you

1:24:05

have the same rules applied in an

1:24:07

interconnected system of sort and so

1:24:09

there's like this interconnected graph

1:24:11

of of information flow and how you act

1:24:14

on that on that graph so as you have

1:24:16

that system and and it goes on over time

1:24:19

probably at some point you will see some

1:24:20

emerging phenomena and i guess at that

1:24:22

point the question is how do i control

1:24:24

that emergence like how can i introduce

1:24:26

some sort of metric of my own to try and

1:24:29

understand what's going on and how to

1:24:31

control it which

1:24:33

to which i would answer that it's

1:24:34

impossible to tell a priori like it's so

1:24:36

task dependent and it's so dependent on

1:24:39

what you're doing that

1:24:40

like if you are trying to optimize for

1:24:42

something then you should have

1:24:44

you should go at the level that we were

1:24:46

saying before like you should go at that

1:24:48

level of abstraction and trying to

1:24:49

understand what are your goals at that

1:24:51

point right so it could be that you're

1:24:53

optimizing for the overall success of

1:24:55

the company

1:24:56

or or whatever it is that you're

1:24:58

developing code for right and so you

1:25:00

might introduce that as a higher level

1:25:02

goal

1:25:03

and hope that what's happening at the

1:25:05

lower level

1:25:06

gets optimized to it to essentially

1:25:09

achieve that objective right which

1:25:11

nature has done to selective evolution

1:25:13

but if you're trying to introduce

1:25:16

that signal into your own control

1:25:18

process uh you you might need to to do

1:25:21

some particular actions at the lower

1:25:23

level so that maybe you can achieve that

1:25:25

higher level objective

1:25:27

i know but this is the tyranny of

1:25:29

objectives though right there's the

1:25:30

shortcut rule there's all of these

1:25:32

because as soon as soon as you formalize

1:25:34

something you you block stepping stones

1:25:36

and and you exclude the actual behavior

1:25:38

that might lead you to where you

1:25:40

actually want to go yeah it's

1:25:41

fascinating but um i do want to move on

1:25:43

a little bit i want to kind of slowly

1:25:45

move the conversation towards your work

1:25:46

but i want to go via this fascinating

1:25:48

article that you that you shared with me

1:25:50

about morphogenesis and actually it was

1:25:52

by this guy i think he's at google he's

1:25:54

called alexander maude vincent vince

1:25:57

and the article was called growing

1:25:59

neural cellular automata and it was

1:26:01

performing uh morphogenesis and more for

1:26:03

jet i mean that sounds like a

1:26:04

ridiculously complicated word but it's

1:26:06

about um you know it's essentially how

1:26:08

if i perturb something or if i have some

1:26:10

initial starting state how could i how

1:26:12

could i create something that i want to

1:26:13

uh create right so um this was using a

1:26:16

cellular automata on images on the 2d

1:26:18

plane and he was able to design a

1:26:21

cellular automata and an update rule

1:26:22

which would quickly converge to a

1:26:24

desired image so there was a a picture

1:26:26

of a lizard

1:26:28

and you could you could damage it and

1:26:30

perturb it and then it would it would

1:26:32

just come back to the lizard and

1:26:35

it's just it's it's incredible to me

1:26:37

right because um it's like from these

1:26:39

local low-level rules you could actually

1:26:42

create something that had global

1:26:44

coherence yeah and i've just never seen

1:26:46

anything like that before so um tell me

1:26:48

a bit about that article yeah that's

1:26:50

amazing uh so that article in particular

1:26:53

uh was inspired by uh this idea of the

1:26:56

flat warm which is like a tiny creature

1:26:59

that if you take it you cut it in half

1:27:01

like both halves are able to regrow into

1:27:04

the whole thing like independently and

1:27:06

so the the question there was how can

1:27:09

this animal be doing this like because

1:27:11

you know the decision to grow is a local

1:27:13

decision and the decision to stop must

1:27:15

be a global decision so there must be

1:27:17

something inside the growing process

1:27:20

that's somehow coordinating the global

1:27:21

shape right and and in fact this this

1:27:24

idea of morphogenesis in cellular

1:27:25

automata was already uh present in

1:27:27

literature of course um and people like

1:27:30

had been doing it uh even ten years

1:27:32

priors uh you know trying to generate uh

1:27:35

or to generate like uh flags so you have

1:27:38

like three states uh cellular automata

1:27:40

with uh different colors and you try to

1:27:42

arrange the cells of a particular color

1:27:44

in a particular region of the images

1:27:45

that you can generate like the flag of

1:27:48

italy or the uk or whatever right so you

1:27:50

can kind of uh see that it grows into

1:27:52

that shape um and what they did in that

1:27:55

paper was bringing it to the absolute

1:27:57

next level right so it was looking at

1:28:00

this platform and say okay it's able to

1:28:02

regrow into the full thing okay can we

1:28:04

do the same thing with a neural network

1:28:07

and so can can we learn to do the same

1:28:09

thing because this goes back to probably

1:28:11

what we were saying before which is

1:28:13

designing these kind of rules can be

1:28:16

insanely hard like you don't know what

1:28:19

the rule is that just by letting it

1:28:21

evolve locally on inputs of pixels

1:28:25

it eventually gives you the lizard or

1:28:27

you know they have this smiley emojis

1:28:29

they have different kinds of emotions

1:28:31

and images

1:28:32

and so how do we design that well the

1:28:34

answer in that case was well we'll take

1:28:36

a convolutional neural network which if

1:28:38

you look at it has essentially the exact

1:28:40

same kind of

1:28:42

shape as the cellular automata so it has

1:28:44

like a local three by three kernel uh

1:28:47

that updates the the state of every

1:28:49

pixel uh synchronously so it's like

1:28:52

there's there's a lot of overlap there

1:28:54

and they said okay let's just uh train

1:28:57

this neural network

1:28:59

in a recurrent way so we're just gonna

1:29:01

propagate forward and then use by

1:29:03

propagation through time to adjust the

1:29:05

weights so that after some steps of

1:29:08

computation we land in a particular

1:29:09

object or objective state um

1:29:13

and and so this is this is what they did

1:29:14

and they were able to

1:29:16

to to make this very very robust

1:29:18

actually so they were able to have the

1:29:21

image grow from a single pixel into the

1:29:23

full thing and then you can start trying

1:29:25

to make that robust perturbation so you

1:29:27

put what happens if i cut the image in

1:29:29

half i would like to grow it i would

1:29:32

like it to grow back into the full thing

1:29:34

and you can actually can introduce that

1:29:36

type of input output examples in the

1:29:38

training process and so that's what they

1:29:40

did and then they have this whole

1:29:42

analysis of what the cellular automata

1:29:44

does

1:29:45

or the neural cellular automata does

1:29:47

for example they let it evolve

1:29:50

way past the training horizon that it

1:29:52

they trained it for uh and so they let

1:29:55

it compute over and over and over again

1:29:57

and at some point what happens is that

1:29:59

it breaks the stability and it kind of

1:30:01

starts producing the same pattern

1:30:03

everywhere on the image so it kind of

1:30:06

the single lizard becomes a pattern of

1:30:08

textured lasers everywhere and in fact

1:30:11

they actually have done some really cool

1:30:13

follow-up work where they actually do

1:30:15

the same to actually generate textures

1:30:18

so you can use that instability to

1:30:19

generate textures on an image um which

1:30:22

is very cool and uh and nature like if

1:30:25

you look at the images

1:30:26

well it is possible to because i know

1:30:29

they did a whole bunch of stuff to

1:30:30

robustify it if you like but it is

1:30:32

possible to make it lose its global

1:30:34

coherence so like on the lizard i would

1:30:36

press in the middle of the lizard and if

1:30:37

i kind of oscillate the mouse cursor a

1:30:39

little bit i could make the lizard grow

1:30:41

another pair of legs and feet yeah but

1:30:44

what fascinates me is is that this is i

1:30:47

don't think it was synchronous either i

1:30:48

think they um to make it resemble real

1:30:51

life a little bit more they they formed

1:30:52

the the update rules randomly and and

1:30:55

stochastically but um it's incredible

1:30:58

though isn't it that just by having

1:31:00

essentially what is a filter back i

1:31:01

think it's a bit more complicated than

1:31:03

that they have a notion of if it's

1:31:04

growing and dead and alpha they've got

1:31:06

about 16 different values of are they

1:31:08

not just rgb for every single pixel but

1:31:10

but but basically it's it's a gridded

1:31:12

cnn and you're just updating this thing

1:31:15

and you get an insane amount of global

1:31:18

coherence from these bottom-up rules and

1:31:20

there are loads of people we're speaking

1:31:22

to that that think that ai must be top

1:31:24

down you know it's not possible for it

1:31:26

to be bottom-up but but this is this is

1:31:28

fascinating right it is it is and so one

1:31:31

thing that i find fascinating is that

1:31:33

there is absolutely no reason why this

1:31:37

should work like at all there is nothing

1:31:39

that we can observe that says that these

1:31:42

kinds of rules should exist at all this

1:31:44

this model in principle is it's like

1:31:46

it's too simple for it to actually work

1:31:49

but in fact it turns out that these

1:31:50

models that these cnns in particular uh

1:31:53

and then in like in my own work we

1:31:55

proved it for for genetic graphs but

1:31:57

like these are universal models so if

1:31:59

there is some kind of computation that

1:32:01

can be expressed in the cellular somata

1:32:03

and like you know by extension as a gnn

1:32:05

as a cnn

1:32:07

then the cnn can implement that

1:32:09

computation and i think that it is

1:32:11

really fascinating that this computation

1:32:13

exists so what what this paper answers

1:32:16

to me is it's not the question of

1:32:17

whether can we do it with a cnn but the

1:32:20

really fascinating thing is that yes

1:32:22

this can be expressed as a process that

1:32:24

you know iteratively and locally kind of

1:32:27

grows the image into what we want and

1:32:29

that's a real fascinating thing like

1:32:31

that

1:32:32

they were able like to actually do this

1:32:35

at all and it is not at all obvious that

1:32:38

they could and but yeah they could do it

1:32:40

yeah

1:32:41

i think the important thing for the

1:32:43

listeners to know is that

1:32:45

yes it has this the small grid which is

1:32:47

its input however the cellular automata

1:32:51

is absolutely not the simple rules you

1:32:54

know that we're used to right like it's

1:32:55

actually a

1:32:56

a a relatively deep

1:32:59

you know neural network behind that

1:33:01

taking a look at that input deciding you

1:33:03

know what to do is that correct oh yeah

1:33:05

i mean it depends on what stream by

1:33:06

complexity like i i would say that you

1:33:09

know being able to compress the

1:33:11

information of the image into you know a

1:33:13

relatively small kernel of a cnn it's

1:33:16

still a

1:33:17

fairly simple way of doing it right so

1:33:19

maybe it's not as simple as you would

1:33:21

have the game of life so you still have

1:33:23

several thousands or probably even

1:33:25

millions of parameters in that neural

1:33:26

network but it's still like it's

1:33:28

encoding a lot of information and

1:33:30

especially what's fascinating to me it's

1:33:32

not that it's just like outputting the

1:33:34

image one shot which of course you know

1:33:36

there would be better better ways to do

1:33:38

it but the fact that it's doing it like

1:33:41

iteratively

1:33:42

like this is a process that by you know

1:33:45

by applying the same rule at every pixel

1:33:48

and doing it doing so iteratively it's

1:33:50

able to output the image and so this is

1:33:52

what i think is really fascinating

1:33:55

yeah so i agree with that i'm just i'm

1:33:56

just trying to set a baseline here so

1:33:58

one thing for the listeners to

1:34:00

understand is that

1:34:02

there is this quite complicated you know

1:34:04

neural network that's looking at the

1:34:05

small window and then deciding you know

1:34:08

how to update so it isn't old-school

1:34:10

cellular automata that have like update

1:34:12

rules that can be written down in three

1:34:13

lines

1:34:15

or something okay and then the other

1:34:16

thing that that very much interests me

1:34:18

about this project in particular is

1:34:21

you know i get on this soapbox pretty

1:34:22

often okay that uh

1:34:25

a neural network as it's typically

1:34:27

conceived which is a neural network

1:34:29

takes you know some some inputs

1:34:32

and it does what is ultimately

1:34:34

equivalent to you can always unroll it

1:34:36

as a forward pass through a fixed depth

1:34:39

you know

1:34:40

uh thing and then you get an output

1:34:42

by itself is not turning complete that

1:34:44

what you need is the ability to do this

1:34:46

iterative

1:34:47

you know computation if you will on kind

1:34:50

of a working space

1:34:51

and that's exactly what we have you know

1:34:53

in this work is there's this plane

1:34:55

and it and it's it's learned this uh

1:34:57

computation that if it gets iterated

1:35:00

over and over again can do very

1:35:02

fascinating things and so i think it's

1:35:04

just important for everyone to

1:35:05

understand that without that iterative

1:35:07

capability without that kind of working

1:35:09

space without that temporal dynamics

1:35:12

you know you don't get this kind of

1:35:13

behavior no exactly exactly and that's

1:35:15

that's exactly what happens right and

1:35:17

like for people working in the gnn

1:35:20

community this would be much more

1:35:22

trivial to to see but like what's

1:35:24

happening is that by recurrently feeding

1:35:27

the output back into as input

1:35:30

into the network

1:35:31

what's happening is that every cell

1:35:34

essentially is able to see farther and

1:35:36

farther away from itself right because

1:35:38

like the receptive field in a sense

1:35:41

aggregates information from the

1:35:42

neighborhood but then so is doing every

1:35:44

other receptive field of every other

1:35:46

cell so after two iteration you will

1:35:48

have reached like a neighborhood of size

1:35:50

i guess four by four instead of three by

1:35:52

three uh and and so you you go on

1:35:54

growing like and this is exactly what

1:35:56

we're doing rough neural networks like

1:35:57

every layer lets you go one step further

1:36:00

and so what's happening with this

1:36:01

iterative computation is that as the

1:36:04

iteration progresses progresses uh every

1:36:07

cell gets access to essentially a more

1:36:10

and more large view of the of the world

1:36:13

system and at some point this

1:36:15

information kind of bounces around like

1:36:17

waves in a pond if you if you think

1:36:18

about it and um

1:36:20

and and it comes back at some point but

1:36:23

that but that's the key but that's the

1:36:24

key right there is at some point and the

1:36:26

problem is that with with irreducible

1:36:29

computations

1:36:30

you don't know at what point that is and

1:36:32

so this t this t parameter is open-ended

1:36:36

the only thing you can do is sit there

1:36:37

computing computing computing that's why

1:36:39

it can never be compressed into any

1:36:42

fixed number of layers it's like you

1:36:44

have to have this open-ended you know t

1:36:47

you have to have an open-ended number of

1:36:49

layers yeah i wanted to unpack this sort

1:36:51

of as well because that there's

1:36:52

something magic about this and it's

1:36:55

exactly as keith said right you know

1:36:57

people even say consciousness itself

1:36:59

what what's emergent and magical about

1:37:01

it is it's reflexive property the fact

1:37:03

that it's constantly going random random

1:37:04

circles and when we look at this

1:37:06

cellular automata even this gridded cnn

1:37:09

version it appears very lifelike and

1:37:10

that's and that's why because we used to

1:37:12

think that neural networks were kind of

1:37:15

like performing iterative computations

1:37:17

and now based on our conversation with

1:37:19

randall balestrurio we know that

1:37:21

actually they're just decomposing the

1:37:23

euclidean space up into these kind of

1:37:24

polytopes and and the amount of

1:37:26

computation is finite so it's a

1:37:28

completely different type of computation

1:37:30

but um

1:37:31

anyway i i wanted to move the the

1:37:33

discussion on to your work danielle so

1:37:36

we've we've we've discussed these um

1:37:39

gridded um uh cellular automata with

1:37:42

with cnns and then graph neural networks

1:37:45

are absolutely fascinating because they

1:37:46

they extend the notion of a cnn into

1:37:50

this world where you can have um any

1:37:52

structure at all so you know the the

1:37:53

concept of message passing for example

1:37:55

it extends the cnn right so you still

1:37:57

have this notion of a neighborhood but

1:37:59

you're not on this gridded plane or

1:38:01

manifold anymore and

1:38:03

you've done exactly the same thing right

1:38:05

you've done this morphogenesis but um

1:38:07

with a point cloud so can you tell us

1:38:09

about that it's absolutely amazing

1:38:11

yeah it was fun because so that whole

1:38:13

paper was about exploring this this very

1:38:16

idea of can we come like people have

1:38:18

been complicating everything about cas

1:38:21

and at some point the question becomes

1:38:22

can you complicate the underlying

1:38:23

geometry and you get the graph cellular

1:38:25

what's on myself um and and then like we

1:38:28

were trying to show that actually graph

1:38:30

neural networks are universal engines to

1:38:32

perform this kind of computation on on

1:38:35

gcas uh and so the task at that point

1:38:38

became like okay can we do more for

1:38:40

genesis on a graph what does it look

1:38:41

like on a graph right then and let's say

1:38:43

the typical visualizable example on the

1:38:46

graph is to take

1:38:48

is to take something that somehow

1:38:49

represents space something that we are

1:38:51

used to interact with as humans uh and

1:38:54

and so this was the point cloud so

1:38:56

points in in space um and we took

1:38:58

several of them we took like this bunny

1:39:01

like thing we took a graph that more or

1:39:03

less represented a writing so some some

1:39:06

letters so something that has like a

1:39:08

spatial kind of notion to it oh and we

1:39:11

were trying to ask the question of like

1:39:13

we were saying before does a rule exist

1:39:15

that starting from a random

1:39:17

configuration of points actually morphs

1:39:19

and and feel like the shape is actually

1:39:21

a real shape if you think about it so

1:39:23

morphs these points into this coherent

1:39:26

shape and and again the cool thing is

1:39:28

that this must happen just through sheer

1:39:31

local message passing so every node at

1:39:34

some point will read the neighbors will

1:39:36

read where it is at that point and we

1:39:38

will decide where to go next and just by

1:39:41

this continuous exchange of information

1:39:43

which at some point again bounces around

1:39:45

to the graph and by the way we have

1:39:46

evidence that no many not not many steps

1:39:49

are needed for this kind of information

1:39:51

to bounce around what you what you

1:39:52

really need is that you at least need to

1:39:54

have as many exchanges as the diameter

1:39:57

of the graph meaning the the most

1:39:59

distance that you have between any two

1:40:01

pair of nodes um

1:40:03

and so like if you can do that at which

1:40:06

what you see is that in fact there

1:40:08

exists a rule that takes you from random

1:40:10

points to bonnie

1:40:12

and it gets there you know fairly stably

1:40:14

as well you can train it to be fairly

1:40:16

stable and so for example what we saw is

1:40:18

that uh because if you think about it

1:40:21

there are like these two regimes that

1:40:22

the neural network must learn right so

1:40:24

it must learn to go from random to bunny

1:40:27

and then from bonnie to bunny so it has

1:40:29

to remain stable once it gets there

1:40:31

right which is what you try to do with

1:40:33

the lizard like you would like the

1:40:35

lizard to remain a lizard even if you

1:40:36

perturb it and the same applies here you

1:40:39

would like the bunny to remain a bunny

1:40:40

even if you perturb it

1:40:42

and so once it gets to the bunny it has

1:40:43

to stay to the bunny

1:40:45

and what you see is that in fact the

1:40:46

network is able to uh you know very

1:40:49

quickly put everything where it's

1:40:51

supposed to be almost immediately like

1:40:53

in two or three steps you know the

1:40:55

random point cloud becomes essentially a

1:40:57

bunny and then it learns to gradually

1:40:59

adjust the remaining points and it is

1:41:02

fascinating that everything is happening

1:41:04

as a as the same rule gets applied

1:41:06

everywhere uh and so we kind of explored

1:41:09

that and uh

1:41:10

it worked fairly well although sometimes

1:41:12

like we had this weird effect that you

1:41:15

probably get as you train a recurring

1:41:17

neural network in the dynamical system

1:41:19

where

1:41:20

so instead of like converging

1:41:22

immediately uh it starts oscillating

1:41:24

around the bunny or around whatever

1:41:27

target you have

1:41:28

and it does this weird oscillations

1:41:30

where it goes from bunny to random to

1:41:32

binding to random and so on forever

1:41:34

and it's really fun when you animate it

1:41:36

because like it looks like the bunny is

1:41:38

stomping on the ground because there is

1:41:40

this weird oscillation on the foot

1:41:42

uh so nice it was really it was really

1:41:44

nice to to work in that uh in that space

1:41:49

amazing i mean in in a way this is an

1:41:50

entirely new as i know you got the work

1:41:52

published in europe's which i think

1:41:54

should give an indication of how

1:41:56

impactful it is but you know you can

1:41:57

think of it as an entirely new model of

1:41:59

computation in a way i mean you said in

1:42:01

the paper that you could apply it to

1:42:02

things like swarm optimization and

1:42:04

control and modeling uh epidemiological

1:42:06

transmission and even improve our

1:42:08

understanding of complex biological

1:42:10

systems in the brain right yeah forget

1:42:12

all that i'm just looking for a

1:42:13

first-person shooter where i'm playing

1:42:15

in a in a world that's just a cellular

1:42:18

automata that self-repairs anytime

1:42:20

somebody does damage to it

1:42:22

yeah you can do that type of stuff like

1:42:24

that that's the cool thing about this is

1:42:27

that once you break free from from the

1:42:30

grid in a sense you're like every time

1:42:32

you have this kind of local interaction

1:42:34

and the cool thing is that the

1:42:36

interaction can signify anything at that

1:42:38

point like it doesn't need to be a

1:42:40

discrete projection of 3d space anymore

1:42:43

which is what did what the image is like

1:42:45

you project the 3d world on the 2d plane

1:42:47

and then you discretize that so it can

1:42:49

be anything it can be you know relations

1:42:52

between humans it can it can be relation

1:42:54

between neurons and whatever is like

1:42:57

doing this kind of

1:42:58

computation through local exchanges in

1:43:01

in whatever geometry of the cells you

1:43:03

want to have

1:43:05

and by the way one thing it also tested

1:43:07

was the setting of the dynamical graph

1:43:09

so a setting in which the graph changes

1:43:11

at every iteration if you want and so

1:43:14

all of that like kind of unlocks a lot

1:43:16

of possibilities because now what you

1:43:18

have is that again if you can't specify

1:43:21

the correct objectives which not

1:43:22

necessarily use it's not something you

1:43:24

can do always or you don't know always

1:43:27

how to do it but if you can

1:43:29

and and if everything turns out to be

1:43:31

differentiable which is another probably

1:43:33

big limitation um then you can train

1:43:36

this object kind of end to end to give

1:43:38

you the desired behavior

1:43:40

right if it is yeah

1:43:42

is that the idea with the so with the

1:43:43

protein

1:43:45

uh protein modeling or synthesis you

1:43:46

know trying to find the dna sequence

1:43:49

that ultimately will give you the

1:43:52

desired protein structure what's the

1:43:54

connection there uh so the connection is

1:43:56

that there is no real connection so far

1:43:58

like i'm not trying to apply this type

1:44:00

of computation onto the protein design

1:44:02

problem

1:44:03

because it introduces like an extra

1:44:05

layer of complexity that i don't think

1:44:07

we're quite there yet to be able to use

1:44:10

this gca stuff reliably to solve any

1:44:12

kind of problem and i'm not even

1:44:14

entirely sure that

1:44:17

any function should be expressed as this

1:44:19

sort of recurrent computation on graphs

1:44:22

so what we're doing with the protein

1:44:23

design is is just trying to solve

1:44:26

different kinds of sub problems which is

1:44:28

for example uh what function should the

1:44:30

protein have and what does that look

1:44:32

like in terms of structure

1:44:34

and once i have the structure what does

1:44:36

the sequence look like so there is no

1:44:38

idea of like

1:44:40

recurrent computation in that space

1:44:43

but in a sense like it's it's similar in

1:44:45

that

1:44:46

you could say you're trying to find

1:44:48

let's say a description for something or

1:44:50

for some for something that has a higher

1:44:52

level behavior uh but in that regard

1:44:55

like this the ca stuff kind of lives on

1:44:57

its own for now i'm hoping that we'll

1:44:59

eventually apply it to you know modeling

1:45:01

protein dynamics or something like that

1:45:03

well what i'm curious about is suppose

1:45:05

uh because the problem of protein

1:45:07

folding itself is is obviously difficult

1:45:09

but suppose

1:45:10

you could design a cellular automata

1:45:12

that could take as input

1:45:14

a dna sequence and then it the some type

1:45:17

of relatively simple

1:45:19

you know

1:45:20

input range on the dna and then it could

1:45:22

run run run iterate and give you

1:45:25

the folded protein as a result

1:45:27

then if that cellular automata was

1:45:29

actually invertible

1:45:31

you could run the reverse computation to

1:45:33

get back to a possible sequence that

1:45:35

would have given you that is there

1:45:37

research into invertible cellular

1:45:40

automata of this nature

1:45:42

okay so let's let's unpack that because

1:45:44

so there are two things uh the first is

1:45:46

that alpha fold actually kind of works

1:45:48

like that meaning that uh it has this

1:45:50

refinement procedure meaning that it

1:45:53

predicts the structure and then it kind

1:45:54

of feeds it back and then tries to

1:45:56

iterate on this on this predicted

1:45:57

structure um

1:46:00

and there is also work uh on reversible

1:46:02

cellular samasa although uh i have yet

1:46:05

to hear uh about reversible neural

1:46:08

cellular

1:46:10

because that would uh imply reversible

1:46:12

you know your neural network and that

1:46:14

required the whole thing to be

1:46:16

integrated essentially right um

1:46:18

but so yeah what would you say is

1:46:20

probably a possible way to do it uh what

1:46:23

i'm wondering if it's you know the best

1:46:25

way to solve the problem because at some

1:46:27

point what i came to realize working so

1:46:29

i had i had the luck to work with many

1:46:31

uh you know

1:46:33

real scientists in a sense meaning

1:46:34

people that actually work with you know

1:46:36

the brain or biology and then people

1:46:39

that actually have a deep biological

1:46:41

biological knowledge um and what i came

1:46:43

to realize is that at some point it

1:46:45

becomes a matter of solving the problem

1:46:47

so it's like solving the problem is more

1:46:49

important than the way you solve it in a

1:46:51

sense right and so if you're trying to

1:46:54

solve protein design

1:46:56

it feels like an exercise in style to

1:46:58

try and do it with a cellular automata

1:47:00

for example because you don't have like

1:47:02

any strong evidence that the the

1:47:05

function that goes from structure to

1:47:06

sequence is actually one one such

1:47:09

recurrent kind of computation that you

1:47:11

need to do

1:47:12

and so at this point like what we're

1:47:13

trying to do

1:47:15

and this is actually like something that

1:47:17

i've tried to force myself to do because

1:47:18

it can become difficult at times is to

1:47:22

not try and use the big guns immediately

1:47:25

so you kind of want to step back and go

1:47:27

back to basics and you know start from a

1:47:29

multiplayer perception and see what what

1:47:31

it does and see if it can actually work

1:47:33

um and try to you know solve the problem

1:47:37

actually solve the problem so you start

1:47:38

simple and you you know stress your

1:47:41

neural network until you until you hit a

1:47:42

wall and once you've hit that wall then

1:47:45

you try and make them a little more

1:47:46

complicated and you try and see if you

1:47:48

know different things could work and i'm

1:47:50

i'm seeing that

1:47:52

that's probably a good way to approach

1:47:54

this this problem so right now

1:47:56

multiplayer perceptions are the way to

1:47:58

go

1:47:59

well wait have you have you taken it one

1:48:01

step further towards simplicity and said

1:48:03

let's start with a linear model and uh

1:48:05

oh right

1:48:06

then

1:48:09

yeah no but you see that that that's

1:48:10

when

1:48:12

sometimes you already know that some

1:48:14

models are not good right because the

1:48:16

thing that i'm trying to do is like

1:48:17

highly non-linear and so like a linear

1:48:19

model probably wouldn't work you can try

1:48:21

even i mean

1:48:22

you can try and you should try probably

1:48:24

but you know it won't work what i'm

1:48:26

talking about is whether you know you

1:48:28

already need to go and look at that

1:48:30

structural source of information do you

1:48:32

need the graph immediately or can you

1:48:34

solve the problem let's say from the

1:48:35

sequence or from you know just the

1:48:37

coordinates without without the graph

1:48:39

representation and so that's what we've

1:48:40

been doing a lot in this in this proton

1:48:42

design space

1:48:44

which as i said is kind of orthogonal to

1:48:46

the work on uh on cellular automata

1:48:48

because like with cellular automata the

1:48:50

question is whether this computation

1:48:53

exists if i can formulate the objectives

1:48:55

can i find the solution with a neural

1:48:57

network like it's a different set of

1:48:59

questions and they're more like

1:49:01

i i don't want to say essential but like

1:49:04

they're at a more basic level than just

1:49:06

you know trying to actually solve a

1:49:08

problem it's more asking questions about

1:49:10

the universe or this particular

1:49:12

computational model and see if the there

1:49:14

are answers

1:49:15

right

1:49:17

yeah

1:49:18

that this whole thing blows my mind i've

1:49:20

only i mean i'm i've only just

1:49:22

discovered this and um from an

1:49:24

engineering point of view i'm fascinated

1:49:25

by this notion of having systems that

1:49:27

can be self-healing

1:49:29

in some sense or even having multiple

1:49:31

agents that are going around my system

1:49:33

and kind of repairing things that get

1:49:35

broken by people

1:49:37

so i guess i mean we'll slowly rap but i

1:49:39

wanted to um

1:49:41

if there are folks that are interested

1:49:43

in some of these topics we've spoken

1:49:44

about so complex systems theory um you

1:49:46

know things like uh craft neural

1:49:48

networks and so on and the work you're

1:49:50

doing

1:49:51

where should they look and also i'm

1:49:52

interested just to know personally what

1:49:54

other areas are you interested in

1:49:56

right uh so as

1:49:58

far as resources go uh

1:50:01

you you can approach it at different

1:50:03

levels so uh if you just want to learn

1:50:05

about cellular automata there's tons of

1:50:07

resources out there and what i would

1:50:09

suggest people do is that they go and

1:50:11

look on twitter which is weird as it may

1:50:14

sound is where like the actual hacker

1:50:16

community is is doing this type of

1:50:19

insanely complex

1:50:21

cellular automata that really have like

1:50:24

once you see them you it's really hard

1:50:26

to to think about them being automata

1:50:28

because the behavior is just so complex

1:50:31

and lifelike and so sometimes you will

1:50:33

find you know some some of these hackers

1:50:37

in this community that

1:50:39

that showed you know their center

1:50:40

automata and then you know side by side

1:50:42

comparison with the real world living

1:50:45

system and they're exactly the same

1:50:47

moving in the same way and it's like

1:50:49

okay so is the ca predicting what's

1:50:51

happening in biology like what what does

1:50:53

that tell you about the nature of the

1:50:54

world and so yeah so i think for the

1:50:57

record i think you may be the first

1:50:58

guest

1:50:59

that's recommended twitter yeah but but

1:51:01

that's the reason for that i love it

1:51:03

that's awesome that's what it is like as

1:51:05

as weird as un unscientific as it may

1:51:08

sound that's that's where interesting

1:51:10

things are happening like you know

1:51:11

twitter is the new archive huh yeah

1:51:13

twitter is the new archive and github is

1:51:16

a new archive like you will find you

1:51:18

know bleeding edge cellular automata on

1:51:21

github you don't necessarily see them

1:51:23

published at all

1:51:24

right now like uh we are starting to see

1:51:27

this ncaa stuff popping up on you know

1:51:30

in europe's icml aclr and it's like

1:51:33

starting to make a breakthrough but you

1:51:36

know it's more there's tim there's hope

1:51:38

for us so you and i may yeah become

1:51:40

researchers

1:51:44

yeah and if you're let's say if you're

1:51:47

interested in more

1:51:48

uh academic work uh especially on the

1:51:51

biology side there is the work of the

1:51:53

entire lab of michael 11 um

1:51:56

and

1:51:57

and it's like

1:51:58

he does a lot of work um

1:52:01

regarding studying emergence in real

1:52:03

biological systems

1:52:05

um and so it's like uh they study uh the

1:52:09

cells of frogs and they

1:52:12

they take cells out of frogs and see

1:52:14

what they do in the different

1:52:15

environment and they were able to create

1:52:17

this like small biological robots

1:52:20

that essentially grow out of skin cells

1:52:22

to create what they call these xenobots

1:52:25

and and that whole group and by the way

1:52:28

uh he is also um part of the that uh

1:52:31

morphogenesis paper with cnn's um and so

1:52:34

like that that whole group is uh is

1:52:36

doing excellent work in that regard i

1:52:38

would say they are the pioneers of this

1:52:40

entire idea of emergence i discovered a

1:52:42

youtube channel called emergent garden

1:52:44

and it's by a guy called max robinson

1:52:47

and he's got some really cool videos

1:52:49

um

1:52:50

i definitely recommend you guys check

1:52:51

that out right okay but does he have a

1:52:53

twitter feed because that's the real

1:52:56

point

1:53:00

you can also keep an eye out as i said

1:53:02

like papers are starting to pop up in

1:53:04

terms of and and this is all in terms of

1:53:06

neural cellular automata if you look at

1:53:07

the literature on cellular automata on

1:53:09

their own like there's a whole bunch of

1:53:11

literature that goes back to the 60s so

1:53:13

like

1:53:14

any kind of variation on the theme has

1:53:16

been explored and proposed and

1:53:19

even for graphs

1:53:20

um and so like right now we're starting

1:53:22

to see this convergence between neural

1:53:25

and uh and cellular in a sense

1:53:27

but

1:53:28

there's tons of literature in

1:53:31

in that whole space uh if you just

1:53:33

approach it from a perspective of

1:53:35

dynamical systems

1:53:37

and and you can see actually really

1:53:39

interesting things so tim before was

1:53:41

asking me about um

1:53:44

this idea clustering the behavior of

1:53:46

rules uh according to you know plus one

1:53:48

plus two plus three plus four and as it

1:53:51

turns out there are pretty clear entropy

1:53:53

measures that naturally cluster the

1:53:55

behavior of rules uh according to their

1:53:58

you know abstract uh behavior and so

1:54:01

like it's uh it's really fascinating

1:54:02

stuff

1:54:03

and you can really see the class four

1:54:04

rules actually have their own space in

1:54:06

this in the center in this entropy

1:54:08

description um so yeah it's um there's a

1:54:11

lot of things you can look into

1:54:13

uh but yeah twitter all the way man if

1:54:16

you if you want to see nice nice images

1:54:18

that's that's where you go

1:54:20

fascinating yeah i mean on the entropy

1:54:21

thing i'm sure carl fristen and even

1:54:23

people like um kenneth stanley you know

1:54:24

the people that study artificial life

1:54:26

they think of um life like uh i don't

1:54:29

know if agents is the right way to do it

1:54:31

but you know the information

1:54:32

accumulation is something that's super

1:54:34

important for for uh the characteristics

1:54:37

of of intelligence and

1:54:38

one one fascinating concept is um the

1:54:41

edge of chaos uh and the work by langton

1:54:43

for example and and that's also

1:54:45

something that pops up continuously in

1:54:47

uh in the right time whatsoever

1:54:51

and elsewhere that's all oh yeah sure

1:54:53

sure sure

1:54:55

well dr danielle uh greta rolla it's

1:54:58

been an absolute honour this has been a

1:55:00

really fascinating conversation actually

1:55:01

i think we need to do loads more content

1:55:04

on on this area this feels like an area

1:55:06

that we've just not really done done

1:55:07

enough on so yeah this has been amazing

1:55:09

thank you so much thank you very much

1:55:11

for having me it was a real honor oh

1:55:14

thank you pleasure

1:55:16

remember to like comment and subscribe

1:55:18

we love reading your comments i really

1:55:20

hope you've enjoyed this episode if you

1:55:22

don't mind please rate us 5 stars on the

1:55:24

apple podcasts app and we'll see you

1:55:27

back

1:55:28

next week

Continue with YouTLDR

Analyze another video with Pro

Process a new video, search every timestamp, compare sources, and keep the result in your library.

Get Pro — $12/month30-day money-back guarantee

More transcripts

Explore other videos transcribed with YouTLDR.