SKI: The Secret Language of Computation

  Рет қаралды 1,067

-Double Negative-

-Double Negative-

Күн бұрын

Пікірлер: 30
@charseraph9175
@charseraph9175 29 күн бұрын
The graphic transitions/music to the Standard Sentence Diagram to SKI was awesome. Love the enthusiasm too!
@the33rdguy
@the33rdguy Жыл бұрын
Making this was a real pleasure. Thank you DN for the opportunity!
@lotsoflambdas
@lotsoflambdas 4 ай бұрын
also ive independently invented the idea of syntax graphs a few weeks ago,but did not find any way to express one of them while preserving locality,because thats not possible
@duvallj
@duvallj 9 ай бұрын
A friend linked me to this, I love it, it's so cursed Graph-like representation of sentences is a neat idea, and choosing SKI with a horrifying phonology tops it off
@lotsoflambdas
@lotsoflambdas 4 ай бұрын
btw ski doesn't actually need the i,which is apparently what the sample text shows,but someone forgot to mention that in the other parts of the video
@Taly_5
@Taly_5 Жыл бұрын
You know i didn't understand anything but still watched the whole video and the main reason for that is because i watched the little thing moving in the top left corner for 8 minutes GGs!
@MatthewConnellan-xc3oj
@MatthewConnellan-xc3oj 5 ай бұрын
We ran out of x’s, Jeremy!
@talezshadid
@talezshadid Жыл бұрын
The33rdGuy is a cool person and im here just to say this 👍
@erikyes
@erikyes Жыл бұрын
I ain’t watching allat 😹😹😹😹😹😹‼️‼️‼️ nvm i did watch it, and it was very interesting. However, i believe all the information will leave my head somewhere in the next 4 minutes.
@talezshadid
@talezshadid Жыл бұрын
It's silksong lore bruv
@usuyus
@usuyus 9 ай бұрын
how does the tree at 5:21 work? f doesn't take 2 arguments? i would have thought it would have been a single chain of f's with x off at infinity...?
@Double-Negative
@Double-Negative 9 ай бұрын
f does take 2 arguments. When you see it with only one, that means a function made by currying f with only one input
@usuyus
@usuyus 9 ай бұрын
@@Double-Negative oh so it's f(f', x) where recursive calls to f are f', right?
@Double-Negative
@Double-Negative 9 ай бұрын
@@usuyus It's like f' = L x. f(f', x) Yf = f'
@eddievhfan1984
@eddievhfan1984 Жыл бұрын
That was a lot to take in, but rather cool. Does this make SKI a context-free grammar?
@Double-Negative
@Double-Negative Жыл бұрын
I think the language of valid SKI expressions is context free. all you really need to make sure of is that the parens are balanced
@stanz47
@stanz47 Жыл бұрын
2:47 I'm just playin silksong right now I guess
@nzeu725
@nzeu725 Жыл бұрын
My excuse for not understanding is that english is not my mother language.
@xarin42
@xarin42 Жыл бұрын
I'm a be honest. I tried, but I just don't get it >~
@the33rdguy
@the33rdguy Жыл бұрын
It's hard to understand lol
@knsc2
@knsc2 Жыл бұрын
Its good yet im not interested, i wish i was.
@the33rdguy
@the33rdguy Жыл бұрын
L
@talezshadid
@talezshadid Жыл бұрын
L
@larrythecarry1441
@larrythecarry1441 Жыл бұрын
L
@maxo6496
@maxo6496 Жыл бұрын
L
@AxtonKincaidILM
@AxtonKincaidILM Жыл бұрын
L
Making Languages Doesn't Have To Be Hard (Conlang) | Worldbuilding
20:19
Worldbuilding Corner
Рет қаралды 52 М.
I Made a Graph of Wikipedia... This Is What I Found
19:44
adumb
Рет қаралды 2,8 МЛН
😜 #aminkavitaminka #aminokka #аминкавитаминка
00:14
Аминка Витаминка
Рет қаралды 1,8 МЛН
Help Me Celebrate! 😍🙏
00:35
Alan Chikin Chow
Рет қаралды 89 МЛН
버블티로 부자 구별하는법4
00:11
진영민yeongmin
Рет қаралды 22 МЛН
Minecraft’s Most Famous Map is Being STOLEN… by Microsoft...
16:57
Why Isn't Functional Programming the Norm? - Richard Feldman
46:09
The Eureka Moment of Linguistics
18:10
Indo-European
Рет қаралды 234 М.
creating the perfect tokirap [epiku]
11:47
jan Misali
Рет қаралды 92 М.
What Is The Most Complicated Lock Pattern?
27:29
Dr. Zye
Рет қаралды 1,5 МЛН
Mpiua Tiostouea, a Language for Time Travelers | Cursed Conlang Circus 2 Entry
19:27
Running "Hello World!" in 10 FORBIDDEN Programming Languages
18:07