What is Hackers' Pub?

계엄에 맞선 시민과 단체들...시빅테크상 수상

2024년 12월 3일 계엄사태는 한국 민주주의 위기의 순간이었지만, 동시에 시민사회의 저항과 디지털 기술이 연결해 민주주의의 새로운 가능성이 드러난 시간이기도 했다. 계엄 이후 시민들은 디지털 기술을 활용해 다양한 목소리를 기록·확산·연결하며 민주주의를 지켜냈다. 시

www.hani.co.kr · 한겨레

철학 공부하는 사람이 빠르게 지나쳐야 할 시기

insta - umlicht리히트 채널에 가입하여 혜택을 누려보세요!https://www.youtube.com/channel/UCmqLfViN12R2dJ0dAN2zlKg/join

www.youtube.com · YouTube

philarchive.org

studenttheses.uu.nl

*The EU's year-old Digital Markets Act is in major peril, reports the Wall Street Journal.* | Nicholas Hirst

*The EU's year-old Digital Markets Act is in major peril, reports the Wall Street Journal.* It says EU and US negotiators have a "tentative" deal to address Washington's concerns on non-tariff barriers. They cite a "draft 'agreement on reciprocal trade' circulated by the U.S. Trade Representative’s office." Putting the DMA on hold would be an unprecedented concession. Key paragraph: "While it doesn’t address tariffs, the draft agreement covers a number of longstanding economic pain points for U.S. firms. It would see the U.S. and EU enter a dialogue on how to implement Europe’s Digital Markets Act—a tech-competition law that has drawn complaints from large American firms—and exempt U.S. companies from enforcement during those talks." https://lnkd.in/ek3r5tnH

www.linkedin.com

좋구마잉 (@jokumaing.bsky.social)

무려 1년 4개월 동안 장관 자리가 비어있었다. https://n.news.naver.com/article/056/0011965618?sid=100

bsky.app · Bluesky Social

3톤 ‘큰 눈’으로 밤하늘 본다…우주 10년 타임랩스 제작 여정

올해 초 ‘ MIT 테크놀로지 리뷰 ’는 남미 안데스산맥에 설치된 베라루빈천문대를 ‘2025년 10대 혁신 기술’의 하나로 꼽았다. 지난해 말부터 관측 준비를 하고 있는 베라루빈천문대가 마침내 23일 첫번째 관측 사진을 공개한다. 미국 국립과학재단(NSF) 광적외선천문

www.hani.co.kr · 한겨레

Python can run Mojo now

Chris Lattner mentioned that Python can actually call Mojo code now. I love this idea (!) as I'm definitely in the market for a simple compiled language that can offer Python some really fast functions.

koaning.io · koaning.io

A Formal Correctness Proof of Edmonds' Blossom Shrinking Algorithm

We present the first formal correctness proof of Edmonds' blossom shrinking algorithm for maximum cardinality matching in general graphs. We focus on formalising the mathematical structures and properties that allow the algorithm to run in worst-case polynomial running time. We formalise Berge's lemma, blossoms and their properties, and a mathematical model of the algorithm, showing that it is totally correct. We provide the first detailed proofs of many of the facts underlying the algorithm's correctness.

arxiv.org · arXiv.org

Towards Advanced Mathematical Reasoning for LLMs via First-Order Logic Theorem Proving

Large language models (LLMs) have shown promising first-order logic (FOL) reasoning capabilities with applications in various areas. However, their effectiveness in complex mathematical reasoning involving multi-step FOL deductions is still under-researched. While LLMs perform competitively on established mathematical reasoning benchmarks, they struggle with multi-step FOL tasks, as demonstrated by Deepseek-Prover-V2-7B's low accuracy (4.2%) on our proposed theorem proving dataset. This issue arises from the limited exploration of diverse proof strategies and the potential for early reasoning mistakes to undermine entire proofs. To address these issues, we propose DREAM, a self-adaptive solution that enhances the Diversity and REAsonability of LLMs' generation strategies. DREAM incorporates an Axiom-Driven Strategy Diversification mechanism to promote varied strategic outcomes and a Sub-Proposition Error Feedback to help LLMs reflect on and correct their proofs. Our contributions include pioneering advancements in LLMs' mathematical reasoning through FOL theorem proving, introducing a novel inference stage solution that improves performance by 0.6% to 6.4%, and providing a curated dataset of 447 mathematical theorems in Lean 4 format for evaluation.

arxiv.org · arXiv.org