Neil Gershenfeld
speaker
1,202 appearances
1 recordings
1 series
first heard May 2023
last heard May 2023
Neil Gershenfeld’s voice in public audio — every appearance, attributed to the second.
Trend
recordings per month · last 12 monthsNo recordings in the last 12 months.Older appearances are listed below; set an alert to hear about the next one.
Appearances
That doesn't work.
That only works in limited subdomains.
You can't do really complex functionality that way.
The one place it's matured, though, is topology optimization for structure.
Let's say you wanted to make a bicycle or a table.
You describe the loads on it, and it figures out how to design it.
What it makes are beautiful, organic-looking things.
These are things that look like they grew in a forest.
they look like they grew in a forest because that's sort of exactly what they are, that they're solving the ways of how you handle loads in the same way biology does.
And so you get things that look like trees and shells and all of that.
And so that's a peak at this transition from we design to we teach the machines how to design.
So understand what it is is much easier than it sounds.
I complained about Turing's machine making a physics mistake, but Turing never intended it to be a computer architecture.
He used it just to prove results about uncomputability.
what Turing did on what is computation is exquisite, is gorgeous.
He gave us our notion of computational universality.
And something that sounds deep and turns out to be trivial is it's really easy to show almost everything is computationally universal.
So Norm Margulis wrote a beautiful paper
with Tom Toffoli showing in a cellular, a cellular automata world is like the game of life where you just move tokens around.
They showed that modeling billiard balls on a billiard table with cellular automata is a universal computer.
Showing 981–1000 of 1,202 · page 50 of 61
← Previous
Next →