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

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)

Indefinite Integral is the Integral of a Function Without any Specified Limits, the Family of Anti-Derivatives of the Function, Expressed As: ∫f(x)dx=F(x)+C.

All The Ways to Get The Ternary Operator

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

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)

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)

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

Line Sweep Algorithm Simulates a Line ("Sweep Line") Moving Across a 2-Dimensional, Processing Geometric Objects, Used in Computer Geometry

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

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

Enhanced Subpixel Morphological Anti-Aliasing is an Image Based Implementation of Morphological Anti-Aliasing which Detects Edges in the Final Rendered Image, Finding Specific Patterns in These Edges, and Then Blending Pixels along These Borders to Reduce Jagged Edges

Stream Control Transmission Protocol (SCTP) with Common Header (Source Port, Destination Port, Verification Tag, Checksum) & Chunk-Based Data. Provides Reliable, Message-Oriented Delivery with Multi-Streaming, Multi-Homing & Four-Way Handshake using Transmission Sequence Numbers (TSN), ideal for Telecom & WebRTC Applications.

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