Tag
A blog post providing a crash course in predicate logic for programmers, explaining predicates, Boolean operators, and syntax to make formal logic accessible.
The article explores the debate on whether computer science is fundamentally about computers, referencing historical perspectives and personal reflections to question the field's essence.
Gemini Co-Scientist, a Gemini-based multi-agent system, has been validated in real-world scientific research across materials science, biology, and computer science, demonstrating capabilities in experimental design, outcome prediction, and improving AI-generated research.
The paper presents a six-stage audit framework for assessing reproducibility in neuro-symbolic AI literature, finding only 6.5% of studies with published artifacts can be reproduced, highlighting a crisis in research reproducibility.
Simon Peyton Jones explains functional programming's mathematical foundations, benefits like improved maintainability, and its influence on mainstream languages, while discussing challenges such as handling side effects.
The article discusses the evolution of x86 memory segmentation, influenced by Unix's flat memory models, and how CHERI and WebAssembly bring back segmented approaches for safety and security, highlighting the recursive nature of memory subdivision.
The article discusses the absence of formal specifications for complex software systems, using hypothetical scenarios to highlight the challenges and importance of formal methods in computer science.
An article examining the evolving role of finite-state model checking in computer science and software verification.
A blog post recommending several classic Computer Science books, highlighting their value for programmers and learners through detailed descriptions.
This paper presents foundational verification methods for establishing running-time bounds in interactive programs, contributing to formal methods in computer science.
Computer scientists have made the first major advance in nearly 30 years on the Komlós conjecture in discrepancy theory, establishing a bound that is nearly constant, which could have broad implications for various mathematical and computational problems.
This paper generalizes the Jaccard distance to arbitrary lattices, proving triangle inequality conditions under various valuations, with applications in quantum information, formal concept analysis, and machine learning.
MIT_CSAIL celebrates the 90th birthday of Margaret Hamilton, a pioneer in software engineering for the Apollo missions.
This article discusses Xorshift generators, a type of fast pseudorandom number generator used in computational applications.
A developer discovers a decades-old bug in Knuth's Algorithm D for long division, leading to a new theorem added to the TAOCP errata, and also uncovers a related bug in LLVM's implementation.
An essay arguing that NP-hard problems are often not as intractable in practice as commonly believed, citing modern solvers and algorithmic advances that handle real-world instances efficiently.
A deep-dive educational article exploring dynamic programming as a unifying principle behind shortest-path algorithms, neural network training, and context-free grammar parsing, tying together automata, optimal control, and linear programming.
In his talk, Carson Gross discussed the impact of AI on university computer science education, arguing that in the AI era, students still need to be taught to write and read code, while also noting that AI brings an assessment crisis and opportunities for pedagogical change.
A tweet recommending Jeff Erickson's free online algorithms textbook, highlighting its great illustrations and overall quality.
Computer science enrollment is declining at U.S. universities, but schools like Colby College are integrating AI education across disciplines to prepare students for a changing workforce.