Відео

this video was just the thing I was looking for🥹

interesting to see how induction on infinity is done, it reminds me of regressus ad infinitum

its like a science fiction movie. I have no idea what u doing there . l m trying to learn gd script and I ve seen your chess tutorial then lm here ..which level of programing is that ?

I'm at 1:22:59: Where you had the viewmat colors. You can see three pair of dark blues diagonally together and two single dark blues that look random. Not coincidence. The diagonal pairs are the relative twins, and the single blues are the ones that were next to "scratched off" ones. You're getting there. Remember the finger counting along the rows thing? Before eliminating the multiples of three? That's where you can easily mark the multiples of the 5s and 7s that you're going to scratch off later are easiest to see. Then just before you eliminate the multiples of 5 is where it's easiest to mark off the multiples of 7 11 13 17 19 23 29 and 31. Or, you do the next best thing which is the prime wheel, so that you can just skip them from the algebraic formula of the sequences without having to mark them off. But in this algorithm, marking them off is the easiest way to avoid the division guesswork.

I don't think about it as removing any numbers. I know that's an anti-concept in the context of sieves but... You start with a single arithmetic sequence that represents all integers greater than or equal to 2. The algorithm simply reshapes that arithmetic sequence into two arithmetic sequences, one of which is all multiples of 2, the other is all the numbers relatively prime to 2. So, taking the series of numbers that are relatively prime to 2, the algorithm reshapes them into 3 arithmetic sequences, one of which is all remaining multiples of 3, the other two sequences are all the numbers relative to 2 and 3. And so on. But no numbers are being eliminated; they're just in another bucket. You can still add up the different arithmetic series from both buckets to produce all integers greater than 1. No numbers are being generated, either. Each arithmetic series is only being separated into sub arithmetic sequences that add up to it, and some get moved over to the other bucket. The sum of all the series in the two buckets is always the set of integers greater than 1. The basic premise of the algorithm is that one bucket always has arithmetic series representing all relative primes in it, and the other has arithmetic series representing all multiples of primes in the other, as it finds primes one at a time.

tough session. deep breaths. "proofing is like a maze..."

What you learned doing this, regardless of whether it helps with the other parts , will speed up anything else you attempt to do. The rate at which you're getting things done now and knowing what to expect from the system is blinding at some points now.

Ouch, the attempts following 1:27:20 were painful to watch. Syntax fits on a postcard. Three levels of precedence. Still not simple enough for some. 1:30:03 -- oooh, your example used readStreamDo: (a keyword message, last precedence, doesn't need the parens). The problem was that unary messages (such as readStream) take precence before binary (symbols) - or keyword -messages, so you were sending readStream to the "test.dot" string, not the result of (Filesystem / '...' / '...') chain. 1:31:30, and you found a work-around, but not the source of your problems 😞 Saaaad.

First of all can you just get to the point, second how are we supposed to contribute when all your names are m,q,n,ks,d etc..

We're learning with you. And the progress is clear to see. Thank you!

Congratulations! That was awesome work! Your persistence in your ever-advancing trial-and-error in reaching your goal is a testament to the trust in your gut of knowing your goal is correct. A lesson for all. I think we all learned more from that one omission of q than we would have from having included it. So, I wish you hadn't forgotten to include it, but I'm also glad you did. Regardless, valuable material here. My learning of Lean will be much faster thanks to your streams. Thank you. I should also mention, I love when you ramble; don't stop doing it. :)

Great job with the proofing. There was a moment that you seem to have flipped a switch and gotten on a roll. I think what you're trying to describe with your Queue is the Just-In-Time calculations. That is, changing the algorithm to calculate the seeds only when they're needed instead of in batch form. As to the twin prime conjecture, you might want to think of it this way: You already know that all possible primes will always be found along the lines of your rake lines, at any iteration. The further along you generate primes, the more rake lines you have, but the narrower your search space for future primes, by 1/p to be exact. You also already know that all your rake lines are parallel to each other, at any iteration. That means that all twin primes no matter how large *must* be somewhere along two rake lines that started out with seeds that had a gap of 2. And, because they are prime and because the sieve works, they will soon enough become seeds of the sieve, generating even more seeds with gaps of 2. All that would be left to prove is that along the rake lines with a gap of 2 there will always be twin primes simply because they each contain infinite primes. I think it's odder to think that the twin primes will somehow avoid each other. :)

This particular sieve is not just a prime sieve because it's not sieving just primes; it's sieving whole arithmetic sequences that have primes as their starting value. Yet, in doing so, it's generating new arithmetic sequences for later sieving.

The number of seeds grows as a function of the current prime multiplied by the number of previous seeds minus the number of seeds that are multiples of the current prime which get eliminated.

In chatGPT try prompts like: "I'm looking for a summary of the keyword "show" in Lean 4, but the documentation I have found in their website is seems to be sprinkled in parts in several places. Could you give one comprehensive summary of the syntax and use of that keyword in Lean 4?"

I see what you're doing here is creating a proof for the general properties of sieves, and then proving that this specific sieve meets the sieve properties, so its results must be primes. I like this method because the first part can be used for any sieve, not just this one, and, with a few tweaks, you'll also be able to use it for other things that are not sieves. So, the proof of the first part becomes even more important than the proof of this specific sieve. Cool!

Please, give the 2nd part, what to do next?

I got to.... make 2D before I had to check youtube. I'm a bit more confused now but I don't blame you. lmao.

I just got PTSD when godot 4 just released, some time ago. Thanks for the Video tangentstream! I never played with UI component as much, with this might align the chessboard universally, that is to say.

great tutorial

keep it bro

I really like that you don't cut out your actual process while working on this, I end up feeling stupid when I watch extremely well prepared / choreagraphed and edited tutorials, and I lose a lot of quality information on how to actually solve problems

how to become as good as you

Although I'm using a completely different framework and work plan, i've decided to watch this project completely, i think i'll learn a lot from a professional like yourself, so keep going and thank you...

3:10 now that you mention it, the !: functions in J reminds me of calling BIOS/XBIOS/GEMDOS functions back when I was playing with 68000 assembly language on the Atari ST: the "groups" were interrupt numbers (called with the "trap" instruction) and the individual functions were opcode numbers you'd push onto the stack (after any other params) before calling it. So to write a character to the screen you might use "bconout", opcode #3 on trap #13 (BIOS). I always found the !: part of J's stdlib really ugly and awkward though; I prefer the K way of doing those things, although I'm not an expert on either.

What is it. I am kind of a beginner.

Regarding your comments at 8:40, I would describe K dictionaries as a list of triplets (key [symbol];value [any];attributes [null or dictionary]) that are addressed by the 1st element of the triplet instead of a numeric index. The attributes don't really have much "magic", they are just a dictionary for storing metadata. The "magic" that you may have been thinking about is that in the K tree some attributes have special meanings (e.g., triggers or dependencies), but that is a characteristic of a specific dictionary (the K tree), not of dictionaries in general. globaltrig:.,(`foo;1;.,(`t;"`0:\"globaltrig invoked \"")) globaltrig[`foo]:7 globaltrig invoked globaltrig[`foo] 7 (the variable is global, therefore it is in the K tree, the t attribute has a special meaning of "trigger", execution of the attribute is triggered whenever globaltrig's value changes, and a message is shown) but, testlocal:{localtrig:.,(`bar;1;.,(`t;"`0:\"localtrig invoked \""));localtrig[`bar]+:x;`0:,$localtrig[`bar]} testlocal[8] 9 (the variable is local and not in the k tree, therefore t is a simple attribute, it does not have the special meaning of "trigger" and no message is shown)

bro you are a fkn genius! jeez! I feel so incompetent lol

So i guess nothing yet. You are talented but you do a whole lot of diff stuff simultaneously

Part 2 plz?😊

Is there a course on Pharo that is truly made for people that have not programmed before? After finishing that what about project based courses that teach how to reach a "enterprise" level of programming skill all implemented in Pharo that can make you hireable in the companies that use Smalltalk? If no new people are onboarded into communities like Pharo, APL, J, Raku etc and they expect only already existing programmers to migrate they are loosing a huge amount of potential programmers that can continue driving forward these super super small communities. Already existing programmers will EASILY leave Pharo or any of the other more less known and used languages as soon as some problem can be solved with some existing library in a much huger ecosystem but true beginners that became programmers by using Pharo or another of the more obscure languages might actually stick with their "first love" more and help create libraries for niche domains and niche use cases.

I have been trying to write very basic eda tools in Godot! Can you put a link down to the talk with Tudor in the description? I've spent some time with Pharo too but i decided against it. This is super interesting I cant wait to see more!

It turns out the "echo" in the clips is not in the clips themselves but a bug in the player component. So: this idea should work just fine if I can locate and drop in a replacement.

Of course I don't actually have time to record any work on this, but... I at least got to explain the idea. :/

Thanks for making a GT series... any chance you would make a video on trying to animate from a sprite sheet?

Hey, thanks a lot for posting this, past me! I know you got interrupted at the end, but next time be sure to check your code into git before you just run off and delete your image to reinstall GT. I made that mistake, but thanks to this video I was able to recreate the animation! :D

It comes back to compose-ability vs walled gardens.

maybe learn editing next

I would say that 2^903 is a "little bit" bigger then "astronomically large" considering amount of atoms in the observable universe ;)

Have you thought about making it in J? There is a J web server as far as I know.

Huh. I guess I don't have this saving the chat? :/ UA-cam cut me off in the middle of a sentence because the stream was over. I'm guessing the same happened to everyone. Nice talking to you guys! Will try to fix that for next time.

Thank you for streaming and recording these videos. There's quite some material on Smalltalk on youtube, but most of the times it's very short introductory videos or just minimal demos; I really appreciate in this case I can instead have an idea of "what it feels like" to develop in Smalltalk/Pharo/GToolkit

At 13:12, I had a moment there because the last node is labeled 30, instead of 31 = 2^5-1. Of course, there still are 31 nodes, but the zero-indexing threw me off, haha!

worst tutorial for making a chessboard ever, he coded a checkbox to change a colour???? wtf???

godot fever dream

Tutorial is very nice but the "cuts" are so robotic lol, it's distracting at some point

what

oh damn oh damn oh damn ....new J movie :D :D :D Best present for Christmas!

The finished "dealing cards in J" video is here: ua-cam.com/video/eXGKK8BkCkg/v-deo.html

Usually I have Descript edit out all the "ums" and long pauses. That might have saved 30 minutes here, but it also makes the video really choppy and I don't have time to go restore all the places it cuts out something important. I'd rather save my editing effort for the scripted videos on my main channel, so it's either automated cuts or nothing. If you're watching these videos, what do you think works better?