Oats!
10:43
21 күн бұрын
Malicious Office Files
10:14
Ай бұрын
Making Minesweeper in COBOL
10:52
6 ай бұрын
Hofstadter!
13:43
8 ай бұрын
Malbolge!: Taming the Beast
17:41
Жыл бұрын
Malbolge!: Programming from Hell
17:51
Computers
46:29
Жыл бұрын
Lambda Calculus!
9:51
Жыл бұрын
C
12:36
2 жыл бұрын
FORTH?
7:34
2 жыл бұрын
Truttle1 Christmas Special
3:32
2 жыл бұрын
Rockstar!
8:28
2 жыл бұрын
So I Made an AI Video Generator...
9:20
GameMaker: The Right Way
11:13
2 жыл бұрын
NDBall!
7:35
3 жыл бұрын
Length!
7:17
3 жыл бұрын
Whenever!
7:21
3 жыл бұрын
ALGOL?
9:41
3 жыл бұрын
(Dead)Fish!
11:40
3 жыл бұрын
Пікірлер
@oserodal2702
@oserodal2702 18 минут бұрын
I swear I feel like you were trying to mess with our heads in your demonstration of the halting problem, cause that pseudocode is *cursed* .
@josephcote6120
@josephcote6120 37 минут бұрын
From the thumbnail it made me say, "Hey! That's Pilot!" We had seen the article in BYTE and said we can write that language. And we made a Pilot interpreter in HP2000 BASIC. The non-computer people who tried it thought it was pretty fun. No real way to hold a lot of text in a program tho, so we ended up with something that smelled a lot like EDLIN.
@user-tl4bg3ci3g
@user-tl4bg3ci3g Сағат бұрын
the glitch parts felt too edgy, but good explanation
@Flourish38
@Flourish38 2 сағат бұрын
The complete comprehensiveness required to write a functioning waduzitdo program sorta reminds me of the spreadsheet that they used to prove that dragster wasn't possible in 5.51 seconds... What I'm saying is, it would be a fun exercise to generate a waduzitdo program that is able to simulate all games of dragster that are less than 6 seconds of input long, frame-by-frame. Also, I wonder how much computation you could allow in a language while still keeping it turing incomplete? I guess you could maybe separate it into a phase where loops are allowed and inputs are gathered, and a phase where loops aren't allowed and basic computations are performed. And maybe you could have multiple of those, so long as no variables carry over between sections? You might be able to do something a LITTLE more useful with that.
@moth.monster
@moth.monster 3 сағат бұрын
libreoffice tho :) it's free and open source and Google can't delete your documents
@Maric18
@Maric18 5 сағат бұрын
ah turing killed by his own government for being gay
@etheraelespeon1986
@etheraelespeon1986 5 сағат бұрын
Ooh, that lang handles conditionals like Shenzhen I/O!
@official-obama
@official-obama 5 сағат бұрын
9:11 opposite takes 2 arguments, but halt probably only takes a function with 1 argument
@unchaynd7266
@unchaynd7266 6 сағат бұрын
Yeah the thing about HTML is that it is representing data, not logic. So it's like a Turing Machine minus the control unit... i.e., just the tape. At least that's my understanding of it
@jeremydavis3631
@jeremydavis3631 6 сағат бұрын
I would argue that every markup language is, technically, a programming language: it tells an interpreter (which is almost always a Web browser in the case of HTML) how to accomplish a task (in this case, displaying a webpage). Of course, without CSS, it's neither Turing-complete nor general-purpose, but not all programming languages are (Waduzitdo is a good example of this). The debate is just a disagreement about the boundaries of an imprecise definition, just like arguing about whether a taco is a sandwich. This got me thinking, though: when it's said that HTML isn't Turing-incomplete, that doesn't include when hyperlinks are used, does it? Theoretically, given infinite storage space, you could encode every possible state of a given Turing machine (both the tape and the state machine) in the name of an HTML file, and each HTML file would contain a link to whatever state follows it. The mathematical definition doesn't care where the impetus for continuing the calculation comes from, so it should be fine, technically, for it to require a user to repeatedly click on whatever link appears on the screen (like turning the crank of Charles Babbage's analytical engine). There can be multiple links per page if we want to take user input (mathematically unnecessary but very important in practice). And the resulting program could even include graphics and sound! So, for example, I can implement an addition quiz program like the one from the video with these HTML pages: guess.html: <html> <body> <p>2 + 2 = ?</p> <ul> <li><a href="wrong.html">0</a></li> <li><a href="wrong.html">1</a></li> <li><a href="wrong.html">2</a></li> <li><a href="wrong.html">3</a></li> <li><a href="right.html">4</a></li> <li><a href="wrong.html">5</a></li> <li><a href="wrong.html">6</a></li> <li><a href="wrong.html">7</a></li> <li><a href="wrong.html">8</a></li> <li><a href="wrong.html">9</a></li> </ul> </body> </html> wrong.html: <html> <body> Wrong answer! <a href="guess.html">Try again.</a> </body> </html> right.html: <html> <body> Correct! 🎉 </body> </html> Notice that guess.html and wrong.html form a potentially infinite loop (a mark of Turing-completeness) with different behavior depending on user input (which is necessary for a general-purpose programming language). This program only needs to remember between 1 and 2 bits of data because it only has a total of 3 states. But as long as we have an unfathomably immense amount of storage space and (rough estimate) a few millennia to write out every possible state transition, it should even be possible to make pure HTML with hyperlinks run a single-stepping version of Doom!
@unchaynd7266
@unchaynd7266 6 сағат бұрын
babe wake up, new Truttle1 video dropped
@chescocooks7697
@chescocooks7697 6 сағат бұрын
I HEARD THAT WONDER BOY REMIX
@Blaineworld
@Blaineworld 7 сағат бұрын
i made an interpreted language called cat in which the only operation is to print the source code of the program. i actually went and secretly installed the interpreter on all unix like systems while you were all asleep!
@photophone5574
@photophone5574 7 сағат бұрын
I remember coming up with something that wasn't turing complete but was kind of an esolang. It was like the brainfuck equivalent of sql/database languages
@yb1_
@yb1_ 7 сағат бұрын
my birthday is 1 day before Alan Turing’s birthday
@kin98100
@kin98100 8 сағат бұрын
There are technically template tags im html which one could describe as am variable
@IceMetalPunk
@IceMetalPunk 4 сағат бұрын
Kind of, but you can't do anything with them without JS. (Data attributes are similar.)
@ArthurKhazbs
@ArthurKhazbs 8 сағат бұрын
So it's gonna be August 4th, 2024. Got it.
@m4rt_
@m4rt_ 8 сағат бұрын
I make my personal websites using only HTML and a little CSS to color things, and change the sizing and placement of things slightly.
@mathe42
@mathe42 8 сағат бұрын
Fun fact: HTML + CSS is Touring complete...
@aadenboy
@aadenboy 8 сағат бұрын
happy burgundy alan turning
@obviousalexc
@obviousalexc 8 сағат бұрын
"OH javascript isn't that bad" - Javascript programmer I am still salty about them deciding not to add operator overrides.
@thisisaplaceholdernamedont6980
@thisisaplaceholdernamedont6980 9 сағат бұрын
0:07 python is also kind of garbage, the more you think about it
@Truttle1
@Truttle1 9 сағат бұрын
Python good
@IceMetalPunk
@IceMetalPunk 3 сағат бұрын
@@Truttle1 Until you need threading, and you realize Python threads don't actually act like threads because of the GIL 😜 I'm a JS and Python programmer, I like both, but you've got to admit they both have their quirks.
@SparkDragon42
@SparkDragon42 9 сағат бұрын
TIL Jr Troopa is older than me (unless you count its European release as I'm European)
@Truttle1
@Truttle1 9 сағат бұрын
He’s older than me in all versions except Chinese lmao
@EdKolis
@EdKolis Сағат бұрын
So you were born between 2001 and 2004, then. About the same age as my little sister, and my nephew (my wife has several older brothers, just like my sister!)
@SparkDragon42
@SparkDragon42 46 минут бұрын
@@EdKolis truttle's birthday is July 26, 2002. So you're right, between 2001 and 2004 :D
@BaldiReycaster
@BaldiReycaster 9 сағат бұрын
Happy Birthday, to Alan Turing!
@randomazzy11
@randomazzy11 10 сағат бұрын
OMG YAY I LOVE YOU TRUYTTLE
@Bulba413
@Bulba413 10 сағат бұрын
remember to be gay on the computer to honor alan turing or else he died for nothing
@chickensoupproductions
@chickensoupproductions 10 сағат бұрын
44th
@TheTriggor
@TheTriggor 10 сағат бұрын
This language doesn't look beginner-freindly at all. Might be nice to make a Hello World, but anything more complex would get frustrating. I'd rather start by learning C than whatever this is.
@vieilatome2257
@vieilatome2257 11 сағат бұрын
Yay new video! And Jr. Troopa is back!!
@gamma204
@gamma204 11 сағат бұрын
alan has birth
@IstvanEgri-zr5sp
@IstvanEgri-zr5sp 11 сағат бұрын
0:06 for C, I have once read a very uncovincing, techical and nitpicky argument in some stackoverflow thread about why it is not turing complete. I do not remeber some things clearly, so I am sorry if I say some incorrect things. The argument was as follows: in order for a programming language to be turing complete, it has to be able to simulate a turing machine. A turing machine, among many things, consists of a tape of indefinate size. In C, the size of objects, for example, arrays is stored in the size_t type, which can only be a finite number, and its size is stored in SIZE_MAX. Because of this, you could not create a turing machine's tape in C, as if you had more than SIZE_T values on that tape (which it could be, its size is indefinite), you could not be able to simulate it inside of a C program.
@gregorykhvatsky7668
@gregorykhvatsky7668 11 сағат бұрын
Nothing is preventing you from writing functions like int get_memory(BigInteger *o, size_t size, char *data) / int set_memory(BigInteger *o, size_t size, char *data) that will then access whatever boundless storage system you have and copy the data between it and system ram
@IstvanEgri-zr5sp
@IstvanEgri-zr5sp 9 сағат бұрын
@@gregorykhvatsky7668 happened to find that thread while searching "c turing complete", they dismiss external storage as not being managed by C (unlike the system ram, the heap)
@lgasc
@lgasc 3 сағат бұрын
_Linked List, among _*_many_*_ others, expresses their disappointment._
@JonGallon
@JonGallon 11 сағат бұрын
8:23 Because yes. Also, reptiles, lots of reptiles.
@retroboi128thegamedev
@retroboi128thegamedev 12 сағат бұрын
hi guyz im like verry super duper new to programing ive ben trying so hard 2 look up on goggle how do eye declare a variable in html
@Truttle1
@Truttle1 12 сағат бұрын
itz verey esey butt itz 2 lang 2 rite ihn uh kahment
@the_jono
@the_jono 12 сағат бұрын
When you had the halting problem code on screen, you showed `opposite(opposite, opposite);` (9:23), implying that `opposite` only takes one argument when it actually takes two. Not too big of a deal, but I figured somebody ought to point that out.
@adamgreene9938
@adamgreene9938 6 сағат бұрын
Actually opposite is supposed to have 2 inputs, one is the function it's testing and the other is the value to run the function on. In this case he's running it on the function itself, which is a little weird, but it does need two arguments.
@official-obama
@official-obama 5 сағат бұрын
@@adamgreene9938 and then it passes it to halt, which expects a function with 1 argument
@sekva
@sekva 12 сағат бұрын
i love the attention to details, like the less than symbol in "Waduzitdo < Turing Machine"
@lilyzheng2322
@lilyzheng2322 12 сағат бұрын
Jr Troopa’s cool
@yandere8888
@yandere8888 12 сағат бұрын
oh wow i didnt know truttle was 1 month older than me i thought hes like 18 lmao
@EdKolis
@EdKolis Сағат бұрын
He's been making these videos for a while now!
@alanbrito141
@alanbrito141 12 сағат бұрын
I have never done any programming But these videos are fun
@citizensnips7949
@citizensnips7949 12 сағат бұрын
How do I send you money and how much of it do I need to send you to convince you to make a video that explores the code of the Python interpreter and discusses what can be added to make it Turing Complete?
@KeinNiemand
@KeinNiemand 13 сағат бұрын
Actually no real conputer is Turing complete becouse computers have finite memory, ehich means for every real computer the halting problem is decidable becouse you know it dosn't halt as soon as the same exact sate of everything repeats.
@schwingedeshaehers
@schwingedeshaehers 12 сағат бұрын
but how do you store it to check it?
@RedstonekPL
@RedstonekPL 12 сағат бұрын
turing complete doesnt mean its a turing machine it means that it can compute everything thats computable also we dont call computers turing complete just programming languages
@antonf.9278
@antonf.9278 7 сағат бұрын
@@schwingedeshaehers Just take you turing machine and store all the states you have seen so far at on the infinite tape. You actually just need enough for 2^n bits where n is the number of bits on disk, in ram, in registers and wherever else the computer can store information.
@official-obama
@official-obama 5 сағат бұрын
@@schwingedeshaehers really big computer (aka turing machine)
@schwingedeshaehers
@schwingedeshaehers 28 минут бұрын
@@antonf.9278 but you said, computers aren't turning machines, so where do you get them?
@clehaxze
@clehaxze 13 сағат бұрын
BUT.. HTML with CSS is truing complete. People built Rule 110.. well
@Truttle1
@Truttle1 12 сағат бұрын
This was talking about pure HTML
@DanielLenrd
@DanielLenrd 12 сағат бұрын
wait what, how?
@clehaxze
@clehaxze 12 сағат бұрын
Yeah I know. I'm being sarcastic
@tylerzahnke8158
@tylerzahnke8158 13 сағат бұрын
Happy birthday Turing! I wonder what he would have thought of the existence of Turing incomplete languages! I mean ones that are trying to pass as programming languages like Waduzitdo is, not languages like HTML that aren't even pretending to be programming languages.
@schwingedeshaehers
@schwingedeshaehers 12 сағат бұрын
you mean like regular expressions?
@tylerzahnke8158
@tylerzahnke8158 12 сағат бұрын
I've been hearing people say that lately, and I don't get it! Yes, I know what regular expressions are, there's a chapter about them in any JavaScript book worth its salt, but still, I only think of regular expressions as a feature of another programming language; I associate them with JavaScript, but I think they've been used in Python, and given the text processing nature of Perl, probably that too. But I don't get this culture around regular expressions as a language. To me, regular expressions are part of a language. Like a data type or object type. I just started hearing in the past few years all this talk like it's a language and I don't get it; I was twelve years old when I learned regex, that's fifteen years ago now, but I just saw it as part of JavaScript, not its own language.
@schwingedeshaehers
@schwingedeshaehers 12 сағат бұрын
@@tylerzahnke8158 maybe look for FSM instead (finite state machine)
@schwingedeshaehers
@schwingedeshaehers 12 сағат бұрын
@@tylerzahnke8158 so lua is no programming language?
@tylerzahnke8158
@tylerzahnke8158 12 сағат бұрын
Who said Lua wasn't a language? The only thing I know about regex is that it's a feature! I see it in the tables of contents of JavaScript books, Python books, etc. as a language feature, not a language.
@Truttle1
@Truttle1 13 сағат бұрын
Discord: discord.com/invite/EKPBjjUc65
@Cliffordlonghead
@Cliffordlonghead 13 сағат бұрын
hi
@Cliffordlonghead
@Cliffordlonghead 13 сағат бұрын
ok
@yglyglya
@yglyglya 13 сағат бұрын
woohoo
@moltony
@moltony 13 сағат бұрын
yooo
@nebularzz
@nebularzz 13 сағат бұрын
hey