Pinned Tweet
Si eres Freelancer o estás bajo #RESICO en el SAT este hilo te puede resultar interesante.
Aquí va mi experiencia en estos meses 🧵
2
300
Puse a Fable hacer el brandbook oficial de Fiscalio y a no ser por unos detalles casi lo one-shotea 😳
22
Ezequiel retweeted
Emite facturas con Inteligencia Artificial y analiza 5 años de tu actividad con aún más inteligencia artificial con Operia.MX #Mexico #Sat #Contabilidad
Pues ya estoy usando Muse de Meta. Ya tengo un agente con tareas automatizadas.
Onboarding: excelente
Integración: buena, por ahi me quedé atorado dandole acceso a una cuenta de Instagram.
Me gusta la UI.
Mi duda principal ¿es gratis o hay límites para agentes?
1
33
Ezequiel retweeted
Mexicans have insane awareness around if it’s noon or not.
I could say “buenas tardes” at 11:48am and without missing a beat or checking the clock they’ll respond with “buenos días.”
"El que domina los rebotes domina el juego".
Después de tanto caer y levantarse ver a Sakuragi meter esa canasta es arte puro.
Slam Dunk. Que joya.
¡Shohoku gana! 🎉 Hace 31 años, vimos a Hanamichi anotar el punto que los llevaría al Campeonato Nacional. 🏀 ¡Comparte si eres fan de Slam Dunk!
#SlamDunk #Anime
32
Bueno ya está creo que el siguiente paso es hacer outreach para Fiscalio.
Si alguien por acá es PF en RESICO y quiere ver como hacer su borrador para la declaración mensual en vivo con Fiscalio yo les puedo apoyar.
Sin contraseñas ni efirma.
40
Ya hay empresas de software que encuentran orgánicamente a Fiscalio y tratan de venderme su Sass.
Pero revisar sus websites me han ayudado a generar un backlog de ideas para Fiscalio mismo.
No es tráfico 100% fino pero algo he de sacar...
28
Mi feed entero se mueve entre el video del Indio de Microsoft comiendo como si no hubiera fin y el video de Lea Seydoux siendo francesa y negándose a comer las muestras de bocadillos que le dan.
Perfectamente equilibrado, como debe ser.
2
80
Ezequiel retweeted
Many of you don't understand how serious this is, so let me break it down.
In computer science there is a famous kind of puzzle called 3-SAT. You are given a long list of yes-or-no switches and a set of rules about how they must be arranged, and you have to find a combination that satisfies every rule. The obvious way to solve it is to try every combination, but each new switch doubles the number of possibilities, so a puzzle with a few hundred switches would take longer than the age of the universe to brute force.
For decades, the smartest people in the field found clever tricks that made this a little faster, but every trick still hit the same wall: the time required kept exploding as the puzzle grew.
About 25 years ago, two computer scientists, Russell Impagliazzo and Ramamohan Paturi, working with Francis Zane, turned that wall into a formal idea.
They proposed the Exponential Time Hypothesis, which says this explosion is not a failure of human cleverness but a law of nature. No algorithm, however brilliant, will ever solve 3-SAT without the time blowing up exponentially. Nobody could prove it, but almost everyone believed it, and it became one of the foundations of modern computer science.
Researchers used it as a measuring stick. If you could show that solving some other problem quickly would also crack 3-SAT quickly, you had shown that problem was hopelessly hard too. Hundreds of papers, across scheduling, graphs, logic and much more, rest on this one assumption.
Now an internal AI model at OpenAI claims to have broken it. It says it found an algorithm that solves these puzzles meaningfully faster than the hypothesis allows, and it has checked the proof in a computer verification system called Lean.
And here is the remarkable part: the very people who proposed the hypothesis, Impagliazzo and Paturi, along with MIT's Ryan Williams, are now leading the public review of whether a machine has disproved their own idea.
So what happens next? If the disproof holds, a large part of theoretical computer science has to be revisited.
Every result that said "this problem cannot be solved faster, assuming ETH" loses its foundation, and researchers will have to work out which of those walls were real and which were simply where we stopped looking. It does not mean everything becomes easy. The new algorithm is still slow in absolute terms and this is not the famous P versus NP problem being solved.
But it means our map of what is possible was wrong in a place we were very confident about, and it was an AI that redrew it. If the disproof fails, the hypothesis survives and the field breathes out, but we will still have watched an AI produce serious, checkable work on one of the deepest questions in the discipline, closely enough that the founders of the idea had to take it seriously. Either way, something has shifted.









