ParsonLabs Music's Landing Page

Custom Voxel Engine Procedurally Generating & Lazy Loading 3D Chunks using Perlin Noise, Lighting Amplified by Ambient Occlusion, Model Transforms, Screen-Space Reflection, Depth Sampling & Frustum Culling

x86_64 Operating System in Rust with Bootloader, Interrupt Handling, Window Manager, VGA Graphics Driver, Terminal Emulation and Software-Rendered 3D Graphics in a no_std Environment All Memory Safe

Karmarkar’s Algorithm is a Polynomial-Time Interior-Point Method for Linear Programming that Efficiently Solves Large-Scale Problems by Iteratively Moving Toward Optimality Inside the Feasible Region with Complexity Roughly O(m^1.5n^2L), Significantly Improving on Prior Methods and Benefiting from Parallel Processing

A Low-Level and Cycle Accurate Super Nintendo Emulator with WDC 65816 CPU Emulation, Full PPU Layering and Mode 7 Support, APU SPC700 & DSP Emulation, DMA/HDMA Timing, Cartridge Memory Mapping with LoROM/HiROM, and Expansion Chip Support (SA-1, SuperFX)

All The Ways to Get The Ternary Operator

Syntax Analysis for Unused Variable & Function Symbols, Supporting; C, C++, JavaScript, TypeScript, Python, Go, Rust & Java

The General Number Field Sieve (GNFS) is the Most Efficient Classical Algorithm Known for Factoring Extremely Large Composite Integers, Typically Those Over 100 Decimal Digits (Like Those Used in RSA Cryptography)

The DPLL Algorithm is a Complete, Backtracking-Based Search Algorithm Designed to Solve the Boolean Satisfiability Problem (SAT) for Formulas in Conjunctive Normal Form (CNF)

Cycle Accurate Game Boy Advance Emulator with ARM7TDMI CPU Emulation, Accurate BIOS and Memory Timings, Pixel-Perfect PPU Rendering, DMA, Timer and Interrupt Handling, Cartridge Save Support, Real-Time Clock Emulation, and Debuggable Execution with Audio

Cross-Platform System Emulator for the Nintendo DS; Formerly Project Nitro / IRIS — Complete System Emulation of Asymmetrical Dual-Core, 32-bit ARM946E-S (67MHz) and ARM7TDMI Co-Processor (33MHz) with respective ARM & THUMB Instructions, High Speed Tightly Coupled Memory (TCM) Hardware-Accelerated GPU for Integer Scaling up to 8x at 4k.

Splay Tree is a Self-Adjusting Binary Search Tree that Dynamically Reorganizes Itself Based on Accessed or Inserted Elements by Moving the Most Recently Accessed Node to the Root Through a Series of Tree Rotations called Splaying

Polyhedral Compiler uses a Mathematical Model to perform Analysis and Transformations on Compiled Programs, Specialising with Nested Loops & Affine Loop Bounds. Polyhedral Compilers Represent Iteration Domains, Access Functions, Dependence & Scheduling, Preserving Semantics

Showcasing the Difference in Execution Efficiency Between Emulator Interpreters vs Just-In-Time Dynamic Recompilers (JIT-Dynarec) with 100 Million Iterations

A Minimal and Interpreted CHIP-8 Emulator with Monochrome Display, Opcode-Level Accuracy, Quirks Mode Compatibility, Timers, Hex Keypad Input, and SuperCHIP Instruction Support for Extended Graphics and Resolution

Cross-Platform & Modular 2D Game Engine with Immediate Mode Rendering, Sprite Batching, Physics Integration, Asset Pipeline, Custom ECS Architecture, Scene Graph Support, Tilemaps, Input Abstraction, and Audio Playback

Extensive Binary Tree Traversal Algorithms Including; Level-Order Insertions, In-Order Traversals, Pre-Order Traversals, Post-Order Traversals, Breadth-First Search (BFS) Traversal & Height Calculations

Generative Model using Markov's Chain Algorithm to Analyse a Corpus of Text to Learn Statistical Patterns of Word Sequences & Use Those Patterns to Generate New, Original Text

The Aho-Corasick Algorithm Efficiently Searches Multiple Patterns Simultaneously Within a Large Text by Constructing a Finite State Machine, Typically Based on a Trie with Failure Links, that Performs Dictionary Matching in Linear Time Relative to the Combined Lengths of the Input Text, Patterns, and Matches Found

The Robertson-Seymour Theorem (or Graph Minors Theorem) States that the Class of Finite Undirected Graphs is Well-Quasi-Ordered by the Graph Minor Relation, Thereby Proving that any Graph Property Closed Under Taking Minors can be Characterized by a Finite Set of Forbidden Minors