body { -ms-overflow-style: scrollbar; overflow-y: scroll; overscroll-behavior-y: none; } .errorContainer { background-color: #FFF; color: #0F1419; max-width: 600px; margin: 0 auto; padding: 10%; font-family: Helvetica, sans-serif; font-size: 16px; } .errorButton { margin: 3em 0; } .errorButton a { background: #1DA1F2; border-radius: 2.5em; color: white; padding: 1em 2em; text-decoration: none; } .errorButton a:hover, .errorButton a:focus { background: rgb(26, 145, 218); } .errorFooter { color: #657786; font-size: 80%; line-height: 1.5; padding: 1em 0; } .errorFooter a, .errorFooter a:visited { color: #657786; text-decoration: none; padding-right: 1em; } .errorFooter a:hover, .errorFooter a:active { text-decoration: underline; } #placeholder, #react-root { display: none !important; } body { background-color: #FFF !important; }

JavaScript is not available.

We’ve detected that JavaScript is disabled in this browser. Please enable JavaScript or switch to a supported browser to continue using twitter.com. You can see a list of supported browsers in our Help Center.

Terms of Service Privacy Policy Cookie Policy Imprint Ads info © 2023 Twitter, Inc.

Conversation

Mel Andrews @bayesianboy@neuromatch.social

Because biology is intractably complex and if you deny this then you’ve picked the wrong question. Toy models are oftentimes the only access point: dlvr.it/RkNdgw

Quote Tweet

Dr. Walter Veit

Why is everyone in my field is turning to highly theoretical models on predictive processing, free energy, etc. The actual evolution of the nervous system is way more fun!

Show this thread

4

1

55

@_fernando_rosas

Replying to

Is there anyway to guarantee the intrinsic complexity of something? I am pretty sure lots of things in physics looked incredibly intractable, until the right way of looking at them was found...

1

5

Replying to

@_fernando_rosas

and

I'm reminded of proofs of complexity such as Gosper's Glider Gun, "the first known finite pattern displaying infinite growth". Also Turing Halting. Knowable unknowable. But that then begs the question that complexity itself, may be the new kind of simplicity we are looking for.

1

1

Dragan Okanovic

Replying to

@_fernando_rosas

and

Not to guarantee, but it is related - busy beaver execution:

Quote Tweet

Quanta Magazine

@QuantaMagazine

“So much of math can be encoded as a question of, ‘Does this Turing machine halt or not?’” said theoretical computer scientist Scott Aaronson. quantamagazine.org/the-busy-beave

2

3

Mel Andrews @bayesianboy@neuromatch.social

Replying to

and

@_fernando_rosas

Is Scott Aaronson a “theoretical computer scientist” or just a moderately clever guy with a blog?

4:29 AM · Dec 25, 2020

Dragan Okanovic

Replying to

and

@_fernando_rosas

Definitely a respected CS researcher. :)

3

Replying to

Aaronson is fantastic, read all his stuff.

5

Replying to

A very good computer scientist with a lot of great work in quantum computing, who also happens to have a popular blog.

2

Replying to

His personal webpage is citing your tweet as a proof of credentials now

1

4