Lukas' Notes

Program

May 01, 20261 min read

computation


Graph View

Backlinks

  • 192.017 Theoretical Computer Science
  • Security properties are undecidable
  • Additive Conjunction (Linear Logic)
  • Additive Disjunction (Linear Logic)
  • Annotation Calculus
  • Axiomatic Semantics
  • Big O Notation
  • Chinese Room
  • Co Decision Problem
  • Co Halting Problem
  • Correct Program
  • Correctness Problem
  • Critical Section
  • Curry-Howard Correspondence
  • Dartmouth Workshop
  • Exactly One of Two Reachable Code Problem
  • Floyd's Rule (Hoare Calculus)
  • Function Property
  • Graph-Reachability Problem
  • Gödel Numbering
  • Halting Problem
  • Hoare Calculus
  • Hoare Triple
  • Homoiconicity
  • Input Parameter
  • Intuitionistic Logic
  • Lemoine's Conjecture
  • Loop Invariant
  • Memory Locality
  • Memory Requirement
  • Modularisation
  • Multiplicative Conjunction (Linear Logic)
  • Mutation Testing
  • Natural Semantics
  • Operational Semantics
  • Partially Correct Program
  • Procedure
  • Process
  • Program Configuration
  • Program Counter
  • Program Proofing
  • Program Semantics
  • Program State
  • Program Transition
  • Reachable Code Problem
  • Recursive Language
  • Recursively Enumerable Language
  • Register Machine Program
  • Runtime
  • Same Output Problem
  • Segmentation
  • Semi-Decidable Decision Problem
  • Spatial Cache Locality
  • Spatial Memory Locality
  • Standard Description
  • Strongest Postcondition
  • Structural Operational Semantics
  • Temporal Memory Locality
  • Totally Correct Program
  • Turing Gas
  • Type
  • Weakest Liberal Precondition
  • Weakest Precondition
  • jal (RISC-V)
  • Crash-only Software
  • Digital Red Queen - Adversarial Program Evolution in Core War with LLMs

Created with Quartz v4.4.0 © 2026

  • GitHub