You can vote now! Vote Here: www.nguh.org/ccc/vote Vote announcement: ruclips.net/video/xw7P26p627k/видео.html Playlist of all entries: ruclips.net/p/PLZI8zCShyGT9f8NoRznDAnIcPkKYXucvt
"sometimes it is necessary to import a library into the context" imagine you're talking to your bro and he casually imports numpy into the conversation 😭
Which is funny, you'd expect them to be incompatible fields given how badly attempts to apply programming-like rigid rules to natural languages turns into a mess (hence why machine translation is a near unsolvable problem)
@@JohnSmith-of2guI mean, once you consider that mathematics is a language and that computer science is technically a branch of mathematics, then it makes perfect sense to state that: computer science ∈ mathematics ∈ linguistics
@@theapexsurvivor9538 Except that mathematics is not a language but a science of structures and relations as there is no single all-encompassing mathematical "language". So it's more like both computer science (which also contains computational stuff that is closer to engineering and natural sciences) and linguistics intersect with mathematics yet how they intersect with each other is up to disctussion.
I initially wasn't looking at the screen at all and just idly thought to myself "Hm, be pretty neat to use that mysterious Unicode symbol that some say represents breaking out of a system/context for the invocation operator..."
I'm not a linguistics major, so I'd often wondered, while idly watching the other submissions to CCC3 and letting the endless waves of jargon roll uncomprehendingly over me, what it must be like to listen to for people who _did_ understand. I fully understand every aspect of this and *_SWEET MERCY_* I am pausing the video every 30 seconds or so to whimper quietly to myself in the knowledge that this is an actual workable language that i could actually train myself to speak (or at the very least write) and that therefore my autism is going to make me do it
When a "Low level is best language" programmer decides to make a conlang. I have ADHD so the need to track the exact state of the entire stack is terrifying for me. I can barely follow this but I watched the whole thing wondering how the structure obligates you to use that messed up vowel chart. Learning that it was reverse 1337-speak with IPA was disappointing at first, but having the solution to the problem of turning the strictly numeric language of computers into something human accessible be "just read the digits like IPA letters lol" did ultimately make me chuckle. My god, I could do such horrible things with that...
You just reminded me of my intermediate value limerick: Given a < b < c, And a real-valued function called g With continuous change In the a to c range, For some x, g(x) = b.
@@brightblackhole2442 Well, if it's priceless, then what could I charge for it? :P It was technically a collaborative effort, anyway. I initially posted it to a group with the last line "Then at some point, g = b." The first comment was praise and the second was a correction, pointing out that "g = b" was both incorrect and impossible, g being a function and b a real number. I think that same person suggested the line as you see it, or something very similar.
very cool. the use of ∩ to create the possessive is genius. the way the partial function application works is interesting too; I probably would've just done [ operator ] (where [] are factor-like quotes) but the way you do it is much better. 17:24 - honestly, to check it maybe you should've made an interpreter for the language. I doubt it would really be that difficult; stack-based languages are notoriously easy to make interpreters for.
@@cmyk8964 At that point we're back to Denial-of-Service rules: You need a larger stack than your target. Then again, this adds the fun twist where, if you fail, you knock yourself out!
"I need a show about programming languages that's halfway between Conlang Critic and Context Free" - me, 18 December 2023 and today I've finally found it
Strangely enough, this is the second conlang I’ve ever come across with a stack-based grammar. Although for the first one, it was supposed to be spoken by an alien species who think in stacks.
I don't think the stack is that bad; in real stack-based languages like German speakers simply avoid growing the stack past a certain point by adding stuff to the context, where a lookup failure results in a safe error and missing elements can be queried from other speakers.
This of course violates some principles of trust given that a malicious party might be involved in conversation, but this is trivially avoidable by communicating over a cryptographic protocol that ensures definitions are verifiably the same as when agreed upon.
@@emilyyyylime- the continued identity of your peers is verified in the medium of conversation, and any falsehood they say can only affect your understanding of their messages which are already at most as trusted as they are.
@@tacticalassaultanteater9678 Of course, under normal circumstances that all stands, the cryptographic add-on is strictly optional and should be negotiated between all parties to ensure everyone has the required libraries installed
Every time I use an RPN calculator and realize how fluid it is, I get the idea of a stack-based conlang, but I always hit a wall when I realize I can barely hold three or four elements of a stack in my head at a time if I really concentrate. When I'm reading something someone else has written (like reading a piece of FORTH code or reading my own input to the RPN calculator since it gave a nonsensical answer) I can't even manage that without scratch paper. Using this as a spoken language would suck untold amounts of ass. I love it.
A big part of why the UTF-8 encodings look so similar is because UTF-8 is a variable length 8-bit-aligned binary encoding. 0xxxxxxx => 7-bit ASCII 10xxxxxx => continuation of multi-byte sequence 110xxxxx => 2-byte sequence 1110xxxx => 2-byte sequence 11110xxx => 3-byte sequence
it's very likely that a human would need another language to be able to speak AHL because it is hard to store list of concepts with first converting it to language (you can't do this with AHL because it would lead to infinite recursion). but maybe an alien (especially one that doesn't have a language center direct built into it's genes) would be able to learn this as an only language.
I was about to attempt to express an idea in pesudo-AHL-assembly but struggled to even get started with it because I can't figure out how I'd translate my idea into logical expressions. So I'll say it in plain English: I think I'd like to fork the language because its phonology and its use of UTF-8 makes it more unusable and incomprehensible than I could handle. I'll just stop at the assembly.
@@PhoenixClank So maybe: ((∃x s.t. x ∈ UTF-8 ∧ x ∈ set of language's characters) → (usability < speaker's threshold ∧ comprehensibility < speaker's threshold)) → speaker wants to fork it
This reminds me of Fith (which you can read about on FrathWiki), but much better(?) and much more cursed. First class functions and being able to import modules certainly makes this better than Fith in my estimation, and having AHL be spoken by humans ups the cursedness a lot. 10/10 language, will learn after I master Ithkuil
it is really really cool that functions can be pushed to the stack in addition to being directly invoked. it's even cooler that currying a function is a language feature. i wanna see an actual programming language do this.
So I am building an interpreter now and this brings up some questions: 1. Is the symbol for ANSWER the blood type A emoji (🅰) or the regional indicator A (🇦)? 2. Are m and p allowed in hexadecimal numbers? 3. What do ∅, ∨, ∪, ⊂ and ⎀ mean? They are in the table at 18:45 but never explained. (I'd assume ∨ is OR and ∅ is what's initially on the stack?) 4. Is there a defined way to handle syntax errors? Or does that just abort the conversation? 5. There is two As in a box in the table at 18:45. Is this a mistake or is there an instruction other than ANSWER that uses a similar symbol? 6. What do instructions do when they would need to access things below the bottom-most element on the stack? (I might find more as I work on this more)
I'm also working on an interpreter, and I can answer a few of these. 1. ANSWER is 🅰. 2. [I have no further information] 3. I would assume ∨ is OR and ∪ is union (opposite of intersect), ⊂ is subset (subseteq but not equal). I don't know about the others. 4. I would assume that syntax errors are ungrammatical. 5. I think that one of them is a mistake. 6. I would think that this is undefined behavior. I have some further questions: 7. How does ⍼ invoke determine the arity of the function it's invoking? 8. What do ⊏ select, ! intensity, 📐 measure, ‟ quote, 🌐 context, 🔀 switch, and ® set do exactly? 9. What happens with "⇒C" or other similar things? i.e. what happens when trying to leave an argument unbound that is past the arity of the function? (Since ⇒ only takes two arguments, and C means "leave the third argument unbound") 10. What do the modifiers of : swap, , dupd, ; swapd, and ` rotd do? 11. What happens when using ⧉ collect, # number, or " string without a modifier?
1. Its the emoji. 2.sure why not. 3. empty set, vor, set union, strict subset, insert into set 4. if there is an error you literlly panic. And run away or something. 5. yes that is a copy error 6. panic
This is beautiful, as a computer scientist I haven't finished the video but i hope there's a VM that can somehow do this because that would be beautiful, and if not, maybe I'll do it myself.
in my dialect invoke would always invoke the topmost element to the second topmost. [alice, bob, love] x invoke becomes [alice, bob loves], where the top of the stack is a function "bob loves" which takes the love object as argument. to get the meaning "bob loves alice" invoke must be applied twice. so: push alice, push bob, push love, invoke, invoke. verbs that can take indirect object would need three invokes: push book, push alice, push bob, push give, invoke, invoke, invoke.
I've never heard of UIUA before, but this video does make me fear it. I applaud your efforts. Have you considered putting together a text to speech program of some sort, which could produce the spoken version of these texts? It would need to be able to combine a consonant and vowel sound, presumably from the IPA reference samples or from home-recorded ones. The only thing that could make this more cursed is having the spoken text be fluent. Alternately, add additional stacks referenceable by tone.
Im at 11:50 right now, what if the modifer function has over 26 variables using a chain of implies-B How do you apply exists/forall for variable beyond that? Or are you limited to just exist-a and exist-b? Also at 13:08, shouldn't we have (x≠y => not (x loves y)) ^ (x loves x) Which gives (x=y v not (x loves y)) ^ (x loves x). Am i missing something here. Also how does =AB work, does it add a new element on the stack? Or does it modify the top element and adds an ^ clause?
I also had a similar idea while messing around with the Uiua programming language but never tried because I'm not good enough at linguistics. Cool language
The spoken section sounds at times very elegant and at times absolutely goofy. I could fall asleep to that! With this "phonotactics" you could pronounce any Unicode text, nay, any binary data! And since you got the IPA already by definition, you could probably get a text-to-speech to read it.
also as written, the sentence (assuming a≠b is a bound on "for all" rather than one of the conditions) translates to "there exists an entity which is loved by nothing but itself". to be "there exists an entity which *loves* nothing but itself" i think the first diag(ac) should be a diag(ab)
Finally, a pidgin for computers and mathematicians! 13:08 This is a logical error, to correctly encode the meaning we should have "x≠y => ~(x loves y)" instead of "x≠y ^ ~(x loves y)", using ^ to stand in for "and", ~ for "not", and => for "implies". Currently, it reads as "There exists something that is identical to nothing, loves itself, and loves nothing", containing no less than two logical contradictions.
I am trying to parse out the translation, and I am noticing some errors (shouldn't thirst have invoke-A not invoke-B) but this is hilarious. and a fun logic puzzle! I'm halfway through, and I've deduced that bella loves that there is a part of Edward that thirsted for her blood (I don't even know how to fix it frankly)
also this might be because I'm a mathematician, not a programmer, but isn't the logical formula at 13:14 wrong? you're saying that there is an x, such that every y is different from x, and then other stuff. it should be for every y, being different from x means x doesn't love y
For future reference, all of your apostrophes in this video are wrong. You used ‘ (U+2018) which is a single open quotation mark. The correct character is ’ (U+2019).
@@TimwiTerby well, I pressed the apostrophe key in my keyboard, if the presentation software inserts the incorrect but very similar looking character I dont really care unless its in the glyph text
Forth extended to Uiua, mixed with Prolog and spiced with APL and TRAC... and encoded as some rarest glyphs hex....I admire you and start afraid of you...😅 Someone is showing off 😉
great language. one question tho. how do you create predicate and function variables? you mentioned the lang supporting third order logic but i dont see how.
Weirdly enough, this isn't the first time I've encountered the premise of stack-based grammar. I don't remember where I saw it first, though, and I'm also pretty sure it was just a thought experiment and not a full-fledged language.
You can vote now!
Vote Here: www.nguh.org/ccc/vote
Vote announcement: ruclips.net/video/xw7P26p627k/видео.html
Playlist of all entries: ruclips.net/p/PLZI8zCShyGT9f8NoRznDAnIcPkKYXucvt
God that phonetic inventory is AWFUL 10/10
"sometimes it is necessary to import a library into the context"
imagine you're talking to your bro and he casually imports numpy into the conversation 😭
the design is very human
The worst part is that every step makes 100% sense. It's natural but so cursed
It might be natural for computers but for humans it surely isn't
@@FloatingChameleon counterpoint: Hungarian exists.
the venn diagram of linguists and computer scientists is a flat fucking circle apparently
Which is funny, you'd expect them to be incompatible fields given how badly attempts to apply programming-like rigid rules to natural languages turns into a mess (hence why machine translation is a near unsolvable problem)
@@JohnSmith-of2guI mean, once you consider that mathematics is a language and that computer science is technically a branch of mathematics, then it makes perfect sense to state that: computer science ∈ mathematics ∈ linguistics
@@theapexsurvivor9538 Except that mathematics is not a language but a science of structures and relations as there is no single all-encompassing mathematical "language". So it's more like both computer science (which also contains computational stuff that is closer to engineering and natural sciences) and linguistics intersect with mathematics yet how they intersect with each other is up to disctussion.
@@Folemaet to those with an internal monologue, there is no difference between a language and a science of structures and relations
@@JohnSmith-of2gu "formal language theory"
LMFAO you used the unknown origin Unicode symbol for invocation. this is a top tier language
I initially wasn't looking at the screen at all and just idly thought to myself "Hm, be pretty neat to use that mysterious Unicode symbol that some say represents breaking out of a system/context for the invocation operator..."
"gogigi" will forever haunt my dreams.
I'm not a linguistics major, so I'd often wondered, while idly watching the other submissions to CCC3 and letting the endless waves of jargon roll uncomprehendingly over me, what it must be like to listen to for people who _did_ understand. I fully understand every aspect of this and *_SWEET MERCY_*
I am pausing the video every 30 seconds or so to whimper quietly to myself in the knowledge that this is an actual workable language that i could actually train myself to speak (or at the very least write) and that therefore my autism is going to make me do it
_import books_
@@chri-k import everything
never have i related to a youtube comment more
gogigi
speaking with my one week old child through a program that translates english to AHL so they can be the first native stack based language speaker
When a "Low level is best language" programmer decides to make a conlang. I have ADHD so the need to track the exact state of the entire stack is terrifying for me.
I can barely follow this but I watched the whole thing wondering how the structure obligates you to use that messed up vowel chart. Learning that it was reverse 1337-speak with IPA was disappointing at first, but having the solution to the problem of turning the strictly numeric language of computers into something human accessible be "just read the digits like IPA letters lol" did ultimately make me chuckle. My god, I could do such horrible things with that...
Brb gonna go write some poetry in boolean algebra
You just reminded me of my intermediate value limerick:
Given a < b < c,
And a real-valued function called g
With continuous change
In the a to c range,
For some x, g(x) = b.
@@hughcaldwell1034 how can you distribute such a priceless masterpiece for free
@@brightblackhole2442 Well, if it's priceless, then what could I charge for it? :P It was technically a collaborative effort, anyway. I initially posted it to a group with the last line "Then at some point, g = b."
The first comment was praise and the second was a correction, pointing out that "g = b" was both incorrect and impossible, g being a function and b a real number. I think that same person suggested the line as you see it, or something very similar.
This is the esolang-conlang crossover I didn’t know I needed. 10/10 brilliantly atrocious
Nice to see someone make an APL parody.
very cool. the use of ∩ to create the possessive is genius. the way the partial function application works is interesting too; I probably would've just done [ operator ] (where [] are factor-like quotes) but the way you do it is much better.
17:24 - honestly, to check it maybe you should've made an interpreter for the language. I doubt it would really be that difficult; stack-based languages are notoriously easy to make interpreters for.
render your AHL speaking enemies unconsious by speaking aloud a fork bomb(assuming something like that can be said in AHL)
hm,
maybe (absolute pseudo code)
"stack. implies^.invoke invoke
ig
Just keep saying `dup` and wait for a stack overflow
Humans do automatic lossy compression past a certain point.
@@cmyk8964 At that point we're back to Denial-of-Service rules:
You need a larger stack than your target.
Then again, this adds the fun twist where, if you fail, you knock yourself out!
Who says YOU need to keep track of the stack if your goal is to overflow the other's stack?@@cameron7374
"I need a show about programming languages that's halfway between Conlang Critic and Context Free" - me, 18 December 2023
and today I've finally found it
Why did this video fit perfectly into my two niches
i am ashamed about the fact that that i have never even thought about a stack-based grammar lmao
Do you have a doc or something with an entire write up of the language? i low key wanna make an interpreter/translator to english for it lol
@@ukaszdrukaa8326same lmao
Strangely enough, this is the second conlang I’ve ever come across with a stack-based grammar. Although for the first one, it was supposed to be spoken by an alien species who think in stacks.
I think this is how R2-D2 speaks, but the characters are encoded in the frequency rather than being mapped to syllables.
I don't think the stack is that bad; in real stack-based languages like German speakers simply avoid growing the stack past a certain point by adding stuff to the context, where a lookup failure results in a safe error and missing elements can be queried from other speakers.
This of course violates some principles of trust given that a malicious party might be involved in conversation, but this is trivially avoidable by communicating over a cryptographic protocol that ensures definitions are verifiably the same as when agreed upon.
@@emilyyyylime- the continued identity of your peers is verified in the medium of conversation, and any falsehood they say can only affect your understanding of their messages which are already at most as trusted as they are.
@@emilyyyylime- simply put, yes they can lie but so can anyone anywhere. Handling that is outside the scope of a comms protocol
@@tacticalassaultanteater9678 Of course, under normal circumstances that all stands, the cryptographic add-on is strictly optional and should be negotiated between all parties to ensure everyone has the required libraries installed
"real stack-based languages like German" absolutely broke me
that "mwa" caught me so fucking off guard oh my god
I wonder what the symbol for a hug would be. XʘXʘ, gossip girl
I like that there are people that are the set intersection of conlanging and functional programming
Every time I use an RPN calculator and realize how fluid it is, I get the idea of a stack-based conlang, but I always hit a wall when I realize I can barely hold three or four elements of a stack in my head at a time if I really concentrate. When I'm reading something someone else has written (like reading a piece of FORTH code or reading my own input to the RPN calculator since it gave a nonsensical answer) I can't even manage that without scratch paper. Using this as a spoken language would suck untold amounts of ass. I love it.
21:33 oops this is actually wrong. C0, C1, and F5-FF could never appear as part of a valid UTF-8 sequence
(🤓)
@@emilyyyylime- The entire video is (🤓), so that's implied for every comment.
And while 00 can, god can't predict what using it in a conversation would do, so it shouldn't be on that table either
@@chri-kprobably like using a nonsense word e.g. prisencolin
@@zihaoooi787 Did not expect a prisencolinensinainciusol reference today
when u introduced the ISBN i lost it
Sorry the bilabial click just looks the most like a zero ¯\_(ツ)_/¯
@@aonothem8475 Unfortunately books printed in Soviet Union do not have ISBN. I have Jules Verne book printed in 1985 and it doesn't have ISBN.
@@kirill9064 there's probably a library for that you can import
as an array language enthusiast i was like "okay this guy just copied uiua and made it a cursed conlang" xD glad to see it being acknowledged tho
A big part of why the UTF-8 encodings look so similar is because UTF-8 is a variable length 8-bit-aligned binary encoding.
0xxxxxxx => 7-bit ASCII
10xxxxxx => continuation of multi-byte sequence
110xxxxx => 2-byte sequence
1110xxxx => 2-byte sequence
11110xxx => 3-byte sequence
Chomsky would be proud
as an enjoyer of both PLD and linguistics, this is amazing
11:17 sad not to see currying
inspired from uiua!! this is truly a masterpiece
As a software engineer this is the human language i wish i had been taught at birth.
it's very likely that a human would need another language to be able to speak AHL because it is hard to store list of concepts with first converting it to language (you can't do this with AHL because it would lead to infinite recursion). but maybe an alien (especially one that doesn't have a language center direct built into it's genes) would be able to learn this as an only language.
25:48 video game foot soldier getting hurt
wow, I genuinely laughed so much throughout this video good job this was a blast to watch :)
“Neatly solves gay fanfiction writers’ biggest problem: third person pronouns”
Real lmao
“No more epithets”
No more referring to hair colors at least
so this is how members of the mechanicus speak to one another
I was about to attempt to express an idea in pesudo-AHL-assembly but struggled to even get started with it because I can't figure out how I'd translate my idea into logical expressions. So I'll say it in plain English:
I think I'd like to fork the language because its phonology and its use of UTF-8 makes it more unusable and incomprehensible than I could handle. I'll just stop at the assembly.
How about: ((language uses UTF-8) *implies* (usability *less than* speaker's threshold *and* comprehensibility *less than* speaker's threshold)) *implies* speaker wants to fork it
@@PhoenixClank So maybe: ((∃x s.t. x ∈ UTF-8 ∧ x ∈ set of language's characters) → (usability < speaker's threshold ∧ comprehensibility < speaker's threshold)) → speaker wants to fork it
UIUA MENTIONED
this made me understand apl better
Gogigi
as someone who recently started learning uiua i very much enjoyed this video
That translation sounds like it’s being spoken by a vampire that can’t stand the sight of blood.
6:08 finally a use for that unicode character
The temptation to write an interpreter will haunt me for at least a week or two.
does this language support wasm
It should definitely get some C FFI, cuz "every usable library is written in C" ©
I suggest using the big yus for importing external (“alien”) libraries, as opposed to standard ones. :3
Jesus Christ
@@Ebunixhey EBU ich hoffe DIF gefällt meine Sprache xD
This reminds me of Fith (which you can read about on FrathWiki), but much better(?) and much more cursed.
First class functions and being able to import modules certainly makes this better than Fith in my estimation, and having AHL be spoken by humans ups the cursedness a lot.
10/10 language, will learn after I master Ithkuil
Can we please have a document for an exact specification of each of the operators? I'm trying to write an interpreter for this.
Thats awesome! Yeah I probably should do that.
I have made a reference document for the glyphs which are defined for now: github.com/Tychology/AHL/blob/main/glyph_reference.md
I started dying of laughter in a bus during the Uiua part. Congratulations!
stack based language with first class functions???
it is really really cool that functions can be pushed to the stack in addition to being directly invoked. it's even cooler that currying a function is a language feature. i wanna see an actual programming language do this.
@@amateurprogrammer25Haskell
@@LoganKearsley oh
16:44 it makes sense since no one gonna actually talk in it...but with the modularity of such language it will be easy to program a human speech :)
How do you deal with accessing function parameters beyond the first 26?
OMG the refernce APL is awsome
THIS IS ABSOLUTELY INSANE AND I LOVE IT
What using a HP calculator does to a MF
im still panic
Go gigi
Never would I have expected to see a CCC submission here. This was always just the Picknick-Song channel for me.
the sequel to complexlang that exactly one person has been waiting for
i started dive into stack based tacit languages with uiua a few months ago. this is a brilliant linguistic take on it (:
this tastes like lambda calculus
It's combinator calculus, which is computationally equivalent to lambda calculus but formally different.
I love this immensely.
The fact this is easy for me to understand and it is turing complete is weirdly funny
So I am building an interpreter now and this brings up some questions:
1. Is the symbol for ANSWER the blood type A emoji (🅰) or the regional indicator A (🇦)?
2. Are m and p allowed in hexadecimal numbers?
3. What do ∅, ∨, ∪, ⊂ and ⎀ mean? They are in the table at 18:45 but never explained. (I'd assume ∨ is OR and ∅ is what's initially on the stack?)
4. Is there a defined way to handle syntax errors? Or does that just abort the conversation?
5. There is two As in a box in the table at 18:45. Is this a mistake or is there an instruction other than ANSWER that uses a similar symbol?
6. What do instructions do when they would need to access things below the bottom-most element on the stack?
(I might find more as I work on this more)
I'm also working on an interpreter, and I can answer a few of these.
1. ANSWER is 🅰.
2. [I have no further information]
3. I would assume ∨ is OR and ∪ is union (opposite of intersect), ⊂ is subset (subseteq but not equal). I don't know about the others.
4. I would assume that syntax errors are ungrammatical.
5. I think that one of them is a mistake.
6. I would think that this is undefined behavior.
I have some further questions:
7. How does ⍼ invoke determine the arity of the function it's invoking?
8. What do ⊏ select, ! intensity, 📐 measure, ‟ quote, 🌐 context, 🔀 switch, and ® set do exactly?
9. What happens with "⇒C" or other similar things? i.e. what happens when trying to leave an argument unbound that is past the arity of the function? (Since ⇒ only takes two arguments, and C means "leave the third argument unbound")
10. What do the modifiers of : swap, , dupd, ; swapd, and ` rotd do?
11. What happens when using ⧉ collect, # number, or " string without a modifier?
Also, for reference, here's the IPA for the example text:
ʡɔ̰ʀɔ̰ɕɨɕɨɕɒzɜ ɢɔ̰θʌ̰bɘ
ʡɔ̰ʒɘʒʌʒɵʒoʒɜʒɪʒɤʒɪʒɤʒoʒɪʒʌʒɘ ɢɔ̰gɨgɨ ɢɔ̰θogɨ fogɨθɔgo fogɨgʌ̰θo
ʡɔ̰ʀɔ̃ɕʌ̰zʌɕɪzɔ̰ɕʌ̰ ɢɔ̰gɨgɨ ʡɔ̰zɤɕɪɕɑzoɕɘzɔ̰ɕɔ̃zɜ ɢɔ̰gɨgɨ ʡʌ ɢɔ̰θɵθɵ ʒa
ʡɔ̰ʀɘ ɢɔ̰gɨgɨ ʡe ʡɔ̰ɕɔ̰ɕɔɕɨɕɨɕʌ̰ ɢɔ̰gɨgɨ ɢɔ̰θɵðɘ ʡɔ̰zʌ̰ɕɵɕɘzɔ̰zɜzʌ̰zɜ ɢɔ̰gɨgɨ ɢɔ̰θɑbɔʀɔ̰
ʡʌʒɜ ɢɔ̰θaθɤʀɪ ʡɔ ɢɔ̰θɵðʌ ɢɔ̰ðʌθɔ̃ ɢɔ̰θɵθɜ cɔ̰bʌ̰ʒɔ̃
ʒa ʡʌʒʌ̰ ɢɔ̰θaθɨ ʒa fogɨgɜgo ʡʌ ʡɔ̰ɕɒɕeɕɨzʌ ɢɔ̰gɨgɨ ɢɔ̰θɑbɔ ɕoʒʌ̰ cɔ̰ðɔ ɢɔ̰θɵðʌ cɔ̰bʌ̰
ʡe ʒɒ ʡɔ̰ɕɔɕɨzɤɕɔ̃ ɢɔ̰gɨgɨ ɢɔ̰θɑbɔ
ʡe cɔ̰ðɔ ɢɔ̰θʌgɔ̰ʀɪ ɢɔ̰θɵθɜ cɔ̰ðɔ
ʡɔ̰ɕeɕɨzʌ ɢɔ̰gɨgɨ ɢɔ̰θabɜʀɔ̰ ʡʌʒɜ cɔ̰ðɔ ɢɔ̰θɤgɔ̰ʀɪ ɢɔ̰θɵðʌ ɢɔ̰ðʌθɔ̃ ɢɔ̰θɵθɜ cɔ̰ðɔ ɢɔ̰θɵðʌʒɜ ʒa cɔ̰bʌ̰ʒʌ̰
ɢɔ̰ðʌθɘʒɜ ʒa ʡɔ̰ɕɔ̰ɕɔ̃ɕɔɕɘɕɔ̃zɤɕɔ̃ ɢɔ̰gɨgɨ ɢɔ̰θɑbɔʀɜ ʡɪʒɘ ɢɔ̰θɵbɔ̃ ɢɔ̰θɵðʌʀɪʀɔ̰ ʡɨ fogɨgʌðɘ
1. Its the emoji.
2.sure why not.
3. empty set, vor, set union, strict subset, insert into set
4. if there is an error you literlly panic. And run away or something.
5. yes that is a copy error
6. panic
@@KinuTheDragon7. Every function on the stack always has a defined arity, by the way it was constructed
For your other questions it would be wisest if I created a reference doncument lol
i appreciate the semantic distinctions these are actually some very interesting ideas in terms of what something means
This is beautiful, as a computer scientist
I haven't finished the video but i hope there's a VM that can somehow do this because that would be beautiful, and if not, maybe I'll do it myself.
I'm not panicking, I'm exited
@@conando025 thats the spirit
bro turned uiua into a conlang
i made this commet at the start of the video lmao i'm very glad i was right
Man sounds like he’s in so much pain reading the translation 😭😭😭
I wonder if something like this would work well as a intermediary language for translating languages.
in my dialect invoke would always invoke the topmost element to the second topmost. [alice, bob, love] x invoke becomes [alice, bob loves], where the top of the stack is a function "bob loves" which takes the love object as argument. to get the meaning "bob loves alice" invoke must be applied twice. so: push alice, push bob, push love, invoke, invoke. verbs that can take indirect object would need three invokes: push book, push alice, push bob, push give, invoke, invoke, invoke.
I've never heard of UIUA before, but this video does make me fear it. I applaud your efforts. Have you considered putting together a text to speech program of some sort, which could produce the spoken version of these texts? It would need to be able to combine a consonant and vowel sound, presumably from the IPA reference samples or from home-recorded ones. The only thing that could make this more cursed is having the spoken text be fluent. Alternately, add additional stacks referenceable by tone.
Less than 10 seconds in and i am in love
Im at 11:50 right now, what if the modifer function has over 26 variables using a chain of implies-B
How do you apply exists/forall for variable beyond that? Or are you limited to just exist-a and exist-b?
Also at 13:08, shouldn't we have (x≠y => not (x loves y)) ^ (x loves x)
Which gives (x=y v not (x loves y)) ^ (x loves x). Am i missing something here.
Also how does =AB work, does it add a new element on the stack? Or does it modify the top element and adds an ^ clause?
22:07 "Just look at it! It looks like an alien!" 😂 Gave me such zefrank vibes out of nowhere and destroyed me
I also had a similar idea while messing around with the Uiua programming language but never tried because I'm not good enough at linguistics. Cool language
The spoken section sounds at times very elegant and at times absolutely goofy. I could fall asleep to that!
With this "phonotactics" you could pronounce any Unicode text, nay, any binary data! And since you got the IPA already by definition, you could probably get a text-to-speech to read it.
yeah the gohgigi is so funny
I LOVE YOU MAN 10/10
That's how Borks should speak.
ɢɔ̰ɡɨɡɨ !
As a French speaker the fact it kinda sounds like Chinese spoken by a drunk Frenchman kinda terrifies me.
Think you forgot a ∧ at 13:18 (after the second negation)
Also the English translation isn't really correct I don't think; the logical expression is a contradiction (∃x∀y | x≠y)
@@emilyyyylime-oh you're right, it should be an implication after the x ≠ y, not a conjunction
also as written, the sentence (assuming a≠b is a bound on "for all" rather than one of the conditions) translates to "there exists an entity which is loved by nothing but itself". to be "there exists an entity which *loves* nothing but itself" i think the first diag(ac) should be a diag(ab)
10/10 absolutely horrifying
Finally, a pidgin for computers and mathematicians!
13:08 This is a logical error, to correctly encode the meaning we should have "x≠y => ~(x loves y)" instead of "x≠y ^ ~(x loves y)", using ^ to stand in for "and", ~ for "not", and => for "implies". Currently, it reads as "There exists something that is identical to nothing, loves itself, and loves nothing", containing no less than two logical contradictions.
I completely lost it when I saw the import statement.
Amazing video. This is my new favourite conlang.
P.S. Was there supposed to be an and before the third diag at 13:08?
I am trying to parse out the translation, and I am noticing some errors (shouldn't thirst have invoke-A not invoke-B) but this is hilarious. and a fun logic puzzle! I'm halfway through, and I've deduced that bella loves that there is a part of Edward that thirsted for her blood (I don't even know how to fix it frankly)
also this might be because I'm a mathematician, not a programmer, but isn't the logical formula at 13:14 wrong? you're saying that there is an x, such that every y is different from x, and then other stuff. it should be for every y, being different from x means x doesn't love y
For future reference, all of your apostrophes in this video are wrong. You used ‘ (U+2018) which is a single open quotation mark. The correct character is ’ (U+2019).
@@TimwiTerby well, I pressed the apostrophe key in my keyboard, if the presentation software inserts the incorrect but very similar looking character I dont really care unless its in the glyph text
@@aonothem8475 Your presentation software is set to German. In German the quotes are „...“ and ‚...‘. In English they are “...” and ‘...’.
This is horribly nonsensical, i love it
actually maybe it is too sensical, i'm not sure at this point
Forth extended to Uiua, mixed with Prolog and spiced with APL and TRAC... and encoded as some rarest glyphs hex....I admire you and start afraid of you...😅
Someone is showing off 😉
would be usable with a more reasonable syllable map, brilliant otherwise
go-gigi
It was only a matter of time until someone made Forth into human language.
great language. one question tho. how do you create predicate and function variables? you mentioned the lang supporting third order logic but i dont see how.
8:10 ooo, generics!
Thats pretty cool
Weirdly enough, this isn't the first time I've encountered the premise of stack-based grammar. I don't remember where I saw it first, though, and I'm also pretty sure it was just a thought experiment and not a full-fledged language.
Thank you
This is awesome
It sounds like chinese quagmire throwing up.