Postări cu #CompSc
#CompSc
Postări publice de pe X care folosesc #CompSc.
Hashtaguri înrudite

jowen@shellofowen@orenji_san_@orenji_san_ based on my experience as compsci student, i been studied ui and ux, so i guess the prob is the proportion, my guess 🤓🤓☝️☝️30252
credit@credit_owthis whole studying compsci thing is so much cooler without the weight of crippling dread weighing my neck down00225
COMP Students and Residents@COMPTraineesOur 1st spotlight is on Jade Fischer from @uvic ! Thank you for your dedication to the COMP SC over the past 3 years!🍁Nous mettons premièrement pleins feux sur Jade Fisher de @uvic ! Merci pour ton dévouement durant les trois dernières années! #COMP-OCMP #COMPSC #MedicalPhysics013124
COMP Students and Residents@COMPTraineesToday we recognize outgoing C3 co-lead Fletcher Barrett from the University of Calgary. Thank you for the last 2 years! 🍁 Aujourd’hui, nous reconnaissons l’ancien co-chef du C3, Fletcher Barrett, de l’Université de Calgary. Merci pour les 2 dernières années! #COMP-OCPM #COMPSC002162
xandão fazendo o L@indiana_xandeAgora vale x tal que x \in {A, B, C} mas x \notin A \cap B ou x \notin C Isso amigo, teoria de conjuntos 2.0 lançada (now with AI!!!)Matheus Marc Guichard @mmarccsO voto dessa pessoa tem o mesmo valor que o meu202108
xandão fazendo o L@indiana_xande@mmarccs@mmarccs Oh wow, eu resumi notação. O ponto segue válido, nenhum elemento em uma intersecção de 3 conjuntos pode deixar de ter alguma propriedade de algum dos 3 conjuntos ou de suas intersecções (em linguagem natural para ver se você entende)20132
xandão fazendo o L@indiana_xande@indiana_xande@mmarccs Você é de que ferinha? em CompSci 6/8 é só pro LinkedIn achar que tu vai pra aula?00024
New on arXiv: Lafa turns pretrained LLMs into 7-8B flow-based models with under 30B training tokens, reaching 2.54x the throughput of a standard autoregressive model at similar quality. Why it matters: faster, cheaper inference. #CompSci0005
Zanda@ZandaLikePanda@bnuuybrained@bnuuybrained Computer systems engineering still has amazing job opportunities, especially in China and Australia. But yeah compsci is cooked.00128
tara ݁ ˖๋ ࣭ ⭑@btrinthedark@intrepidshallot@intrepidshallot i barely count as a cs major i am yet to pass anything related to cs10126- s@intrepidshallot@btrinthedark@btrinthedark compsci major brain disease is highly contagious you're vulnerable because you're an accomplice00117
SketchyMingo@DomsArtCorner"If the bubble pops the economy will be ruined too"The Macro Paper @macropaperr🚨 US LAWMAKERS ARE NOW PREPARING FOR THE AI BUBBLE TO BURST. House Democrats have introduced a resolution opposing government bailouts for AI companies if the industry crashes. Instead of rescuing them with taxpayer money, lawmakers want failed AI companies to go through normal bankruptcy. And the timing is extremely concerning. Some of the world's biggest tech companies are investing billions into AI startups that spend heavily on their products. • Nvidia invests in CoreWeave, which buys Nvidia chips. • Microsoft invests in OpenAI, which spends billions on Microsoft's cloud services. • Amazon invests in Anthropic, which uses Amazon's cloud infrastructure. Billions are moving between companies that are becoming increasingly dependent on each other's spending. And lawmakers are raising concerns about the growing use of borrowed money by Big Tech and Wall Street to finance the AI boom. The resolution is not law, but it shows that some lawmakers are already worried about what happens if the industry collapses. If AI startups run out of funding, they could be forced to slash spending or declare bankruptcy, leaving their investors and suppliers facing massive losses. And without government bailouts, a major failure could spread across chipmakers, cloud providers, banks and the broader stock market. The biggest risk is that one major AI bankruptcy could trigger losses across an entire industry worth trillions.923.7K45.5K421K
🚨 US LAWMAKERS ARE NOW PREPARING FOR THE AI BUBBLE TO BURST. House Democrats have introduced a resolution opposing government bailouts for AI companies if the industry crashes. Instead of rescuing them with taxpayer money, lawmakers want failed AI companies to go through normal bankruptcy. And the timing is extremely concerning. Some of the world's biggest tech companies are investing billions into AI startups that spend heavily on their products. • Nvidia invests in CoreWeave, which buys Nvidia chips. • Microsoft invests in OpenAI, which spends billions on Microsoft's cloud services. • Amazon invests in Anthropic, which uses Amazon's cloud infrastructure. Billions are moving between companies that are becoming increasingly dependent on each other's spending. And lawmakers are raising concerns about the growing use of borrowed money by Big Tech and Wall Street to finance the AI boom. The resolution is not law, but it shows that some lawmakers are already worried about what happens if the industry collapses. If AI startups run out of funding, they could be forced to slash spending or declare bankruptcy, leaving their investors and suppliers facing massive losses. And without government bailouts, a major failure could spread across chipmakers, cloud providers, banks and the broader stock market. The biggest risk is that one major AI bankruptcy could trigger losses across an entire industry worth trillions.5682.1K17.3K2.9M
Cultistbird@Cultistbird@DomsArtCorner@DomsArtCorner Ts genuinely would save my future job prospects as a compsci major in college rn 🤑2130219.7K
Python 3.15.1, 3.14.9 and 3.13.17 are out as an expedited security release. They bundle pip 26.2.2 and certifi 2026.10.19 for the eMudhra CA incident. Why it matters: bundled root certs don't update themselves, so upgrade and rebuild images. #CompSci00027
☆ Steffi ☆@j1xciAfter the exam, I have realized the value of studying. I will be trapping myself in campus for the next two hours to study for my next exam... wait for me underdogstwt...4346478
☆ Steffi ☆@j1xci@sahlofolinanana@sahlofolinanana Compsci and Stats (hopefully?). I say hopefully cause I'm not 100% sure I will keep myself stats major, but I'm hoping I can cause stats interests me more than compsci !!! What's yours ???10119
all the compsci and ai people are talking about ETH today 😜Rishabh Karnawat @rishabhkioMany 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.102193
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.3331.6K17K1.5M
binah@failmoderI hope in a few years we can look back and see how silly this sort of thing is29852.3K34K
Slumpy@Slumpy__@Slumpy__@failmoder As someone who’s taking comp sci rn i try not to use it just for discipline/learnings sake but its easily the norm to be using it constantly but i also don’t care at all about the ‘artistry’ of programming to refute its use on the same ground as it sucking for art and etc303344
tetrischemist@TetrisChemist@Slumpy__@Slumpy__ @failmoder Idk how people who are in school for compsci maintain any hope. I'm 2 years out from my degree and, while I have an alright job, it's not in CS10180
We are giving away mac minis - who wants one?Ivan Burazin @ivanburazinWe have a few Mac minis left over from our Daytona event in San Francisco. Thought we'd give 3 away to people building something cool. To enter: 1. Follow @daytonaio 2. Reply with what you'd build with a Mac mini and tag 2 people who'd build something cool with one. We'll randomly pick 3 winners and announce them on October 30th. Winners will be contacted directly via DM. Good luck! No purchase necessary. US residents 18+. Rules below.2.2K544.3K359K
We have a few Mac minis left over from our Daytona event in San Francisco. Thought we'd give 3 away to people building something cool. To enter: 1. Follow @daytonaio 2. Reply with what you'd build with a Mac mini and tag 2 people who'd build something cool with one. We'll randomly pick 3 winners and announce them on October 30th. Winners will be contacted directly via DM. Good luck! No purchase necessary. US residents 18+. Rules below.78042527406K
tormotx@tormotx@saralucijad@saralucijad Would be super grateful to get one, I'm studying compsci & my laptop is running on fumes lol001258
ً@Ixttieao3 situation backing up why i switched from compsci to another career because that is way too much pressure00187
What career advice am I even supposed to give my 15yo right now? His favorite subject has been computer science, he likes speech & debate, is very social. He is skeptical that college makes sense at all, and I am entirely unsure at this point330221.7K118K
Kyo@kyogres@lisatomic5@lisatomic5 I have a compsci degree. A degree isn't necessary to prove your skills, but it sometimes IS necessary to get hired. (Lots of employers require engineering or CS degrees.) Get an academic scholarship -> go to college for cheap/free -> intern in the summer -> job offer10026
jerry@ANerdNamedJerryNO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NJABBA1GER 💍💒 NEWLYWED ❤️ @JABBRWONGRi would love to tell you but ive been completely dissociated and havent formed a single thought since orientation so i dont know. I Dont Know8201903.4K
JABBA1GER 💍💒 NEWLYWED ❤️@JABBRWONGRi would love to tell you but ive been completely dissociated and havent formed a single thought since orientation so i dont know. I Dont Know10275359.6K
jerry@ANerdNamedJerry@JABBRWONGR@JABBRWONGR yea because usually for those classes it's a lot more studying10098
jerry@ANerdNamedJerry@ANerdNamedJerry@JABBRWONGR also uhhh. compsci student so my classes are usually project heavy so. 10173
Cultured Swine (@culturedswine2.bsky.social)@tales_tomorrowNext up: What? You want a livable wage while working at MCDONALDS? If you wanted more money, you should have found the perfect job instead of just getting a job at McDonalds.Barefoot Student @BarefootStudentMark Cuban says Gen Z should stop chasing the perfect job: ‘Just get a job,’ even at McDonald’s, per Fortune.21131.4K11.6K
Mark Cuban says Gen Z should stop chasing the perfect job: ‘Just get a job,’ even at McDonald’s, per Fortune.434891.4K2.4M
Oblivion_Folder@Oblivion_Folder@tales_tomorrow@tales_tomorrow I remember when it was “just get a degree, any degree, doesn’t matter”. Then it was “get a compsci degree/STEM degree, nobody wants your English lit degree”. Then it was “college is a waste of time and money, go to trade school”. Now it’s “just go to work anywhere”.2151608- Arată mai multe postări










