#computer-science

Liminal is a programming language that treats uncertainty as a first-class concept. It allows developers to explicitly represent and work with uncertain values directly in the code.

The Wren programming language is designed for high performance with a compact virtual machine and fast garbage collection. It features a simple class-based object model and supports both object-oriented and functional programming paradigms. Performance benchmarks show Wren competes favorably with other scripting languages in execution speed.

A computer science student has published their four years of academic notes, totaling 850 pages, typeset in LaTeX. The comprehensive collection covers the entire undergraduate curriculum and is available for public viewing.

CS 244 is a Stanford University course focused on reproducing network research. Students work to replicate published networking papers and evaluate their results.

The video discusses how computer science can become a trap for intelligent individuals, potentially limiting their broader career development and creative potential despite their technical abilities.

Paul Graham discusses programming languages that are considered weird or unusual, exploring what makes them different from mainstream languages and why they might be valuable despite their unconventional approaches.

The article discusses how to generate random floating-point numbers between 0 and 1 in programming. It explains the mathematical principles behind uniform distribution and provides implementation examples in various programming languages.

This document is a PDF of the 1994 C edition textbook "Foundations of Computer Science" by Alfred V. Aho and Jeffrey D. Ullman. The textbook covers fundamental computer science concepts including algorithms, data structures, and programming principles using the C programming language.

The article presents a collection of monoid examples, exploring various mathematical structures that satisfy monoid properties. It categorizes different types of monoids with practical illustrations and applications in programming contexts.

Compilers employ clever memory access techniques to optimize performance. These tricks help programs run more efficiently by managing memory usage effectively.

The article distinguishes programming as solving explicit problems algorithmically, coding as implementing solutions in formal languages, and software engineering as building real-world products that include communication, management, and scalability concerns.

The article introduces algebraic effects as a programming concept, explaining them in accessible terms for developers who may not have a background in functional programming or category theory. It aims to demystify the topic by using practical examples and analogies rather than mathematical abstractions.

JavaScript consists of fundamental building blocks including values, operations, and execution contexts. The language's core components work together to create closures and manage variable scope during program execution.

This introduction to C programming covers the language's fundamental concepts, syntax, and core features. It explains basic programming structures and how C serves as a foundation for system-level development.

This presentation introduces reverse engineering concepts, explaining how to analyze software and hardware to understand their inner workings. It covers fundamental techniques used to examine compiled code and systems without access to original source materials.

The article discusses bootstrapping compilers, where a compiler is written in its own language and can compile itself. This approach creates self-hosting systems that can evolve independently of other toolchains.

FP4 is a 4-bit floating point format that represents a significant reduction from traditional 32-bit and 64-bit floating point standards. This compact format enables more efficient storage and computation in resource-constrained environments like edge devices and AI accelerators.

Paris is a computer scientist, game designer, writer, and artist based in Hobart, Tasmania. He co-founded Secret Lab, which created games like Night in the Woods and developed the Yarn Spinner narrative tool used in thousands of games. He has written over 20 books, holds a PhD in Computing, and occasionally teaches at the University of Tasmania.

A puzzle game challenges players to use graph search algorithms to solve problems. The game provides an interactive way to learn about different search techniques through gameplay.

Sorting Algorithm: The Game is an interactive web-based game that challenges players to test their understanding of sorting algorithms. Players must arrange elements in correct order while learning about different algorithmic approaches.

The article explores the concept of driving compilers, examining how compilers work and their role in software development. It discusses the technical aspects of compiler design and implementation processes.

The article explores object-oriented programming capabilities in the Ada programming language, discussing how Ada implements OOP concepts through its type system and features like tagged types and inheritance mechanisms.

The article discusses programming concepts that are widely appreciated by developers, while arguing that garbage collection and object-oriented programming should not be considered among these favored ideas.

The author discusses software books they wish existed, including topics like configuration management, complex data schemas, computer science for software engineers, MISU patterns, essential tools for developers, historical optimizations, and Sphinx documentation internals. They reflect on the unique value of books compared to blogs and online resources in software education.

The article discusses the philosophy of coroutines, exploring why the author finds them appealing and examining different ways to use and conceptualize them in programming.

The author expresses strong dislike for bubblesort, calling it an awful sorting algorithm and wishing people would stop teaching it.

The article contrasts demonic nondeterminism, where systems make worst-case choices to verify properties on all paths, with angelic nondeterminism, where they make best-case choices to verify properties on any path. Angelic nondeterminism underpins complexity class NP and serves as an abstraction in declarative languages.

This article presents a follow-up to previous work on finite-state transducers for aperiodic tilings, exploring further developments in the mathematical approach to these complex geometric patterns.

The article details the author's historical mistakes in implementing loop detection algorithms for graphs while developing puzzle games. It serves as a cautionary guide about common pitfalls in graph traversal and cycle detection.

The article introduces the boolean and bitwise XOR operators, explaining their uses and leading into more advanced topics related to these operations.