Designing a Full-Scale Computational Language: 40 Years of Language Innovation

preview_player
Показать описание

Follow us on our official social media channels.

Рекомендации по теме
Комментарии
Автор

Listening to Stephen Wolfram speak is like listening to Jazz for an hour.

KALLAN
Автор

Iterative functions are much more like analogue computation. Creating via feedback a fractal shape in time.

KaliFissure
Автор

He will be remembered in 500 years as the father of the great computational simulation

cameron
Автор

Really interesting, thanks! Could you talk about how a causal graph might look from the frame of reference of something travelling at the speed of light? I also wondered how the speed limit of the universe is actually defined (or permitted to be broken) within your framework.

I've tried to picture light's frame of reference before as essentially scaling the universe down along its direction of travel, such that as far as it's concerned it hits its target zero seconds (or some universal minimum time) after it is emitted. Not sure if that's correct.

briangork
Автор

So you mean that the rules are sort of an endless adress space and by selecting entrances and departures in the automata you build codeblocks? It seem a very slow way to get things done if you must generate some billion forks of the automata before you get the region of code you need. And would there not be rather alot of entrances and departures to the autombata to build some interesting code to do something?

To me it seem we never gonna get a instruction block of more then a few hundred bits maybe as few as some 40 to 50 bits "we want" by let the automata work for the full day?

Could we not just as well search in regions of PI or TAU to use as adress space or any PRNG or integer sequence to get our code block?
A cellular automata is pretty close to a integer sequense you have some rule and make an expansion, but here the expansion forking more complex, but we can build such integer sequences that is feedback on multiple previous results.

JmanNo
Автор

idea: graphs that are aware they are graphs!

CandidDate
Автор

You need Natural Language Processing, otherwise, you're making a confusing thing even more confusing. I call this the token complexity explosion. Where your commands are so foreign, one tends to forget them, thus you might as well be writing in Chinese to an English speaker. Just my 2 cents.

CandidDate