Natalia

My personal rule is that it's a good idea to be patient as long as I'm in the mix. If I'm taking action, putting in my reps, and trying things out, then I should remain patient and see what opportunities arise. But if I'm not taking action consistently, then I'm not practicing patience. I'm just waiting.

The Dallas Bed Rest Study is terrifying. 5 college students were put on complete bed rest for 3 weeks. 30 years later, researchers found them again. 3 weeks of inactivity did more damage than 30 years of ageing.

Keep thinking.

“We have the technology of an advanced civilization balancing precariously on an emotional base that has not developed much since we dwelt in caves”

“Perception has been replaced for me with functional, pragmatic memory. This has made me more efficient, in some ways, but the cost is an impoverished experience of the richness of the world.”

"Never attribute to malice that which is adequately explained by ignorance or incompetence."

"Set your house in perfect order before you criticize the world"

My favorite subway pastime is reading other people’s text messages.

@ne0x438242 Thanks! Maybe the social interaction recognition piece is on-device. It detects whether you’re talking with others, not the content of the conversation.

An app that gives you a VO2 Max equivalent for your mental health. It tracks your exercise, phone usage, content consumption, and social interaction (passively listening to your real-life conversations).

To go to Rome, to go to Rome— Great the journey, little the gain. If you do not carry Him with you, You will not find Him there.

My podcast with @duolingo Director of Product @naticsti is live! Highlights: 1. Duolingo's early investments in AI-powered features 2. How Duolingo validated it was building the right stuff 3. Launching and optimizing Duolingo Max Check out the full episode on Spotify 👇 open.spotify.com/episode/7wWXLO…

Mathematicians are brutally honest people.

@Retailinvesto19 I’m not mad, just fascinated

@naticsti At least they try, you dont have to be mad

At a café eavesdropping on a couple who sound like they’re on their fourth date (post-hookup brunch energy), and their main topic of conversation is how they organize their closet. What is life. If I had to sit through that, I’d fake a phone call and walk into traffic.

Oh my goodness. GPT-o1 got a perfect score on my @CarnegieMellon undergraduate #math exam, taking less than a minute to solve each problem. I freshly design non-standard problems for all of my exams, and they are open-book, open-notes. (Problems included below, with links to GPT-o1's answers.) While eating Pie in the afternoon, I showed the exam to one of our math Ph.D. students (a former International Mathematical Olympiad Gold Medalist from Belarus), and he said "Hmm. Non-Trivial. Good." Our undergraduate students are also very good. This exam was not easy for them, as the score distribution shows. Today is the 2-year anniversary of the public release of GPT-4. Two years ago, it caught my eye because it exhibited sparks of insight, similar to what I would see when I talked to clever kids who learned quickly. That gave me the instinct and urgency to start warning people. Today's observation of GPT-o1 being able to ace my hard college exam, makes me feel like we're close to the tipping point of being able to do moderately-non-routine technical jobs. I was impressed by every student in my class who got a perfect score. The fastest such person took 30 minutes. And GPT-o1 only costs $60 per million words output, which means that each problem cost about 5 cents to solve. A total of around 25 cents, for work that most people can't complete in 1 hour. Problem 1: Consider the recurrence a_n = a_{n-1} + a_{n-2}, with the first initial condition being a_0 = 1. Find all real number values for the second initial condition a_1 such that lim_{n \rightarrow \infty} a_n = 0. chatgpt.com/share/67d4d4bf… Problem 2: Find coefficients such that the sequence a_n = n \sqrt{2} + 2^n \pi satisfies the following recurrence, for some initial conditions. You don't need to find the initial conditions. a_k = ___ a_{k-1} + ___ a_{k-2} + ___ a_{k-3} chatgpt.com/share/67d4d4fe… Problem 3: Fill in the blanks. The middle entry of the result of: [[0, 0, 1], [1, 0, 0], [2, 3, 4]]^n [[5], [6], [7]] is the term a_n of this recurrence: a_k = ___ a_{k-1} + ___ a_{k-2} + ___ a_{k-3} a_0 = ___ a_1 = ___ a_2 = ___ chatgpt.com/share/67d4d61d… Problem 4: Consider the recurrence with initial condition a_0 = 1, where for each n \in {1, 2, 3, ...}: a_n = \sum_{k=0}^{n-1} a_k Find the generating function f(z) = a_0 + a_1 z + a_2 z^2 + ..., which looks something like f(z) = (1-2z)/(1-z) chatgpt.com/share/67d4d63c… Problem 5: Prove that the coefficient of x^{2025} in (x + x^2)^0 + (x + x^2)^1 + ... + (x + x^2)^{2025} is a Fibonacci number chatgpt.com/share/67d4d657… My main work nowadays is to build and scale up a community of people (through education) to face the challenges of the AI age together. I thought I had more years. Now we have to move faster.

Claude 3.7 Sonnet making a 3blue1brown kind of video like it's nothing the moment we have ai that makes videos like this, learning will be much different

Til' death duo part 💔

all birds go to heaven