Sending love! I discovered Beatnik earlier this week and it's my favourite new toy atm. I have read that it is not turing-complete, but implementing multiplication and division was relatively* easy -- today, I solved arbitrary comparison which can give output depending on equality, lesser, and bigger. Which is a stepstone for multidigit in/out-put**, as far as arithmetics are concerned. __ *) will most likely require more than 5.000 and less than 100.000 words of code. I exploited the limitation of the number range, which is not mentioned in the video. **) Beatnik at face value allows input only one byte at a time. What I am looking for is an arithmetic algorithm, that takes as input: + an operation + two numbers and then outputs the result, without driving the user insane (accepting user-insanitiy would be easier to implement, tbh). So far, I managed to solve for addition for bases 1 (push every 1 from input, then print every item from the stack), 2 (introduces the concept of carrying), 3-10 (implements carrying and extends on it by checking if any couple of digits' result requires carrying.) However, the adding algorithm is expected to crash to terminate, but hopefully, user will be able to read the result, upside-down. Unless there is a power-outage. Because saving in file? I don't dig.
My idea: Objective Beatnik Numbers: Each word value is turned into a character, then the whole string is parsed into a float (all subsequent decimal points or minus signs are ignored). An ellipsis "..." next to a word means to ignore that word. 5-14: 0-9 15: decimal point 16: minus sign e.g. -12.34 can be written like this: 16, 6, 7, 15, 8, 9 Any other values are ignored. Commands are written like this: (opcode) (punctuation) (argument if any) (punctuation) Opcodes (absolute value is taken first): 0,n: push n onto stack 1,0: pop x,y, then add 1,1: subtract 1,2: multiply 1,3: divide (x/0=inf, 0/0=NaN) 1,4: modulo 1,5: power 1,6: pop x, push sqrt x 1,7: pop x, push ln x 1,8: negate: pop x, push 1 if x=0 or NaN, 0 otherwise 1,9: less: pop x,y, push 1 if x
if you want to do a little more programming things, load, has the scrabble score of 5 pushing onto the stack take, has the scrabble score of 8 taking input from the user
How much do you enjoy the consumption of paper? I'm fairly sure that most people haven't given it a try, and it's certainly not recommended for most types of paper, but some people (like John Green for example) do occasionally consume paper or toilet paper with varying degrees of enjoyment, partially dependent on the makeup of the paper since some paper tastes better than others.
1:47 omg a bad wurd!!!1 Also, here is a great video about stacks: th-cam.com/video/IWQ74f2ot7E/w-d-xo.html Also also, this video seems very slow. Also also also, the boss should be classified as an SCP for writing cognitohazardous poetry. Also also also also, this comment could be a program in an esoteric programming language.
And yes, this video was slower, but that was due to people telling me I was going too fast in earlier videos. :p And your comment causes a "pop from empty stack" error when run in Beatnik.
Just wondering, at one point you say that the hardest is to get to 65 in the alphabet and then it's just a matter of duplicating and adding small numbers. But can't you push directly a value of 65 by putting a very long word in your program?
Yes. But that would be inefficient. Imagine how much longer Brainfluff’s Hello World program would be if it just started with 65 +’s. It would work, but it’d be terrible.
Some very long words for use in Beatnik, for your consideration: Llanfairpwllgwyngyllgogerychwyrndrobwllllantysiliogogogoch = 110 “n” pneumonoultramicroscopicsilicovolcanoconiosis = 68 “D” floccinaucinihilipilification = 48 “0” antidisestablishmentarianism = 38 “&”
@@cmyk8964 1 puts you in the middle of the lowercase letters 2 puts you at the start of the uppercase letters 3 puts you EXACTLY at the start of the digits 4 puts you near the punctuation, and math operators
![[Carlventures] FALSE!](/img/n.gif)
I would love to live in a world where everybody is just dancing all the time for no reason
I’d gladly live in a world with a floating turtle made by a 3 year old lol
@@orangegaming9562 I don't think it was by a 3 year old
@@monke5100 ik, but if I was told that was made by a 3 year old I wouldn’t argue
@@orangegaming9562 oh, my bad, didn't know that
what is stopping you ?
Truttle: I want to keep this channel family friendly!
Also Truttle: 1:46
the only non-family friendly truttle video
1:47
2:27
esolang that makes you write the next death grips album
Instead of pushing and popping, the language seems like it's popping and locking
Kitchen sand? Isn't that salt?
I feel the main premise of this lang is the same as length, just with scrabble in mind instead.
the hitchhikers guide to the galaxy reference as 0:40 was hilarious
Beatnik sounds like Beat mea-
Sending love!
I discovered Beatnik earlier this week and it's my favourite new toy atm. I have read that it is not turing-complete, but implementing multiplication and division was relatively* easy -- today, I solved arbitrary comparison which can give output depending on equality, lesser, and bigger. Which is a stepstone for multidigit in/out-put**, as far as arithmetics are concerned.
__
*) will most likely require more than 5.000 and less than 100.000 words of code. I exploited the limitation of the number range, which is not mentioned in the video.
**) Beatnik at face value allows input only one byte at a time. What I am looking for is an arithmetic algorithm, that takes as input:
+ an operation
+ two numbers
and then outputs the result, without driving the user insane (accepting user-insanitiy would be easier to implement, tbh).
So far, I managed to solve for addition for bases 1 (push every 1 from input, then print every item from the stack), 2 (introduces the concept of carrying), 3-10 (implements carrying and extends on it by checking if any couple of digits' result requires carrying.)
However, the adding algorithm is expected to crash to terminate, but hopefully, user will be able to read the result, upside-down. Unless there is a power-outage. Because saving in file? I don't dig.
Thanks for the comment, black ice. :)
@@Truttle1 thanks for being awesome!
Little update: A calculator for +-*/ turns out to be possible (with certain restrictions).
Actually codig it: Prepare to write an Epos!
Can we appreciate that the creator’s name is Cliffle Biffle
My idea: Objective Beatnik
Numbers:
Each word value is turned into a character, then the whole string is parsed into a float (all subsequent decimal points or minus signs are ignored). An ellipsis "..." next to a word means to ignore that word.
5-14: 0-9
15: decimal point
16: minus sign
e.g. -12.34 can be written like this: 16, 6, 7, 15, 8, 9
Any other values are ignored.
Commands are written like this:
(opcode) (punctuation) (argument if any) (punctuation)
Opcodes (absolute value is taken first):
0,n: push n onto stack
1,0: pop x,y, then add
1,1: subtract
1,2: multiply
1,3: divide (x/0=inf, 0/0=NaN)
1,4: modulo
1,5: power
1,6: pop x, push sqrt x
1,7: pop x, push ln x
1,8: negate: pop x, push 1 if x=0 or NaN, 0 otherwise
1,9: less: pop x,y, push 1 if x
if you want to do a little more programming things,
load, has the scrabble score of 5 pushing onto the stack
take, has the scrabble score of 8 taking input from the user
Commenting to feed the algorithm. No idea why it sent me here, but a good find deserves a little snack :)
I enjoy this video like I enjoy the consumption of paper
How much do you enjoy the consumption of paper? I'm fairly sure that most people haven't given it a try, and it's certainly not recommended for most types of paper, but some people (like John Green for example) do occasionally consume paper or toilet paper with varying degrees of enjoyment, partially dependent on the makeup of the paper since some paper tastes better than others.
couldn't you've just ninja'd the sand be?
Kitchen sands could be.... *An abandoned kitchen within a king's castle?*
1:47 omg a bad wurd!!!1
Also, here is a great video about stacks: th-cam.com/video/IWQ74f2ot7E/w-d-xo.html
Also also, this video seems very slow.
Also also also, the boss should be classified as an SCP for writing cognitohazardous poetry.
Also also also also, this comment could be a program in an esoteric programming language.
2:30 is how I anticipated the comment section will react to that word.
And yes, this video was slower, but that was due to people telling me I was going too fast in earlier videos. :p
And your comment causes a "pop from empty stack" error when run in Beatnik.
My favourite part of your videos is NOTHIIIIIIIIIIIINNNNNGGGGGGG
Just wondering, at one point you say that the hardest is to get to 65 in the alphabet and then it's just a matter of duplicating and adding small numbers. But can't you push directly a value of 65 by putting a very long word in your program?
Yes. But that would be inefficient. Imagine how much longer Brainfluff’s Hello World program would be if it just started with 65 +’s. It would work, but it’d be terrible.
@@pantallahueso yeah but here it's beatnik not brainfuck 😌
Some very long words for use in Beatnik, for your consideration:
Llanfairpwllgwyngyllgogerychwyrndrobwllllantysiliogogogoch = 110 “n”
pneumonoultramicroscopicsilicovolcanoconiosis = 68 “D”
floccinaucinihilipilification = 48 “0”
antidisestablishmentarianism = 38 “&”
@@cmyk8964 in toki pona, kijetesantakalu is 30.
@@cmyk8964
1 puts you in the middle of the lowercase letters
2 puts you at the start of the uppercase letters
3 puts you EXACTLY at the start of the digits
4 puts you near the punctuation, and math operators
1:47
The sound is too loud sometimes. Maybe look into sound compression in you're editing software
i agree
*you're
@@Blue-Maned_Hawk it's actually your
@@dodgeneon8093 Either way, the first guy got it wrong
@@Blue-Maned_Hawk I made an edit for you
yay!
Bro really took 3 years to make the vid 💀
Is that Rook I saw?
haha program go 🅱️
You should have More following.
beatnik(todeath)
i really enjoy your use of TheFatRat music throughout your videos! are you a fatrat fan?
Why do you have to count to 66? Is there a limit on how long words can be? Or is it just because it would not actually be a word to get it to 66?
have you ever made your own esoteric language
Yes truttle made his own esolang, that is called "uyjhmn n".
2:30 W̵̬̒H̸̠̃A̵͇͂Ţ̸͛
Arent pneumonoultramicroscopicsilicovolcanoconiosis, etc. in wanted values?
beatnik applause
9:44 i just had to laugh!!
cool video!
10/10
7:20
5:57 Oof
haha 0:37
i got that reference
Jupiter a******s lol
B
420 like