Tag
HP re-releases the classic HP-16C computer science calculator as a Collector's Edition, featuring 100x faster performance, seamless base switching, bitwise operations, and program storage capabilities.
Daniel Lemire explores what fraction of 64-bit integers can be expressed as the product of two 32-bit integers, finding that only about 17% are, with implications for hash function design.
A computer science graduate and mathematics minor built a functional 32-bit computer inside Minecraft using Redstone circuitry.
This 1985 paper by Peter Naur argues that programming is essentially a theory-building activity, where programmers develop a deep understanding of the problem domain, rather than simply producing code.
This article from Scientific American highlights Sharla Boehm, a pioneering programmer whose simulation work at RAND Corporation in the early 1960s laid critical groundwork for the modern Internet, yet her contributions were largely forgotten in mainstream histories.
The article identifies 'tree mapping'—the challenge of representing general graphs as hierarchical structures—as a third hard problem in computer science, alongside naming things and cache invalidation, and explores its manifestations in file systems, writing, architecture, and biology.
A new type of zero-knowledge proof leverages Gödel's incompleteness theorems to overcome previous limitations of secrecy, establishing a striking connection between mathematical logic and cryptography.
This article presents a minimalist 7-line interpreter for a Turing-equivalent functional language based on lambda calculus, demonstrating the eval/apply design pattern.
This paper introduces Louver, a novel index structure for KV cache retrieval that reformulates sparse attention as a range searching problem, guaranteeing zero false negatives and improving efficiency over existing methods.
A social media post explaining the P vs NP problem by comparing NP to a 'magical computer' that always finds the right path, referencing MIT's Introduction to Algorithms course.
The article discusses point-free logic programming, a concept related to functional programming paradigms.
Researchers from Tsinghua University have developed a new shortest-path algorithm with O(m log^{2/3} n) complexity, surpassing Dijkstra's algorithm, which had been considered theoretically optimal for 41 years.
This paper argues that computer science conferences should require nonrepudiable experimental results to prevent tampering and denial, and introduces K-Veritas, a reference implementation for signed reports without accessing training data.
An article detailing eight lesser-known 8-bit era microprocessors, including the Texas Instruments TMX-1795 and Mostek 5065, exploring their historical significance and design features.
The article explains the design of the ASCII table, specifically why there is a gap between uppercase and lowercase letters, highlighting how this structure facilitates efficient case conversion using bitwise operations.
An essay exploring seven foundational programming language archetypes (ur-languages) that underlie most modern programming languages, arguing that learning fundamentals rooted in these archetypes is more important than the specific language chosen.
PKUFlyingPig/cs-self-learning 是一个开源的计算机科学自学指南，整合了众多名校的优质课程资源，帮助自学者系统地学习CS，涵盖数学、编程、系统、AI等多个领域。
OSSU's computer science curriculum provides a free, self-taught education in CS using high-quality online courses from top universities, designed to match undergraduate degree requirements.
An open, unconventional textbook covering mathematics, computer science, and artificial intelligence from first principles, including an MCP server for AI assistants to use as a knowledge base.