Lukas' Notes

Program

Jan 29, 20261 min read

computation


Graph View

Backlinks

  • Additive Conjunction (Linear Logic)
  • Additive Disjunction (Linear Logic)
  • Annotation Calculus
  • Axiomatic Semantic
  • Chinese Room
  • Co Decision Problem
  • Correctness Problem
  • Critical Section
  • Curry-Howard Correspondence
  • Dartmouth Workshop
  • Floyd's Rule (Hoare Calculus)
  • Function Property
  • Halting Problem
  • Hoare Calculus
  • Hoare Triple
  • Homoiconicity
  • Input Parameter
  • Instruction Trace
  • Intuitionistic Logic
  • Loop Invariant
  • Memory Requirement
  • Modularisation
  • Multiplicative Conjunction (Linear Logic)
  • Mutation Testing
  • Natural Semantic
  • Operating System
  • Operational Semantic
  • Partially Correct Program (Hoare Calculus)
  • Procedure
  • Process
  • Processor Time
  • Program Proofing
  • Reachable Code Problem
  • Recursive Language
  • Recursively Enumerable Language
  • Register Machine Program
  • Runtime
  • Segmentation
  • Semi-Decidable Decision Problem
  • Standard Description
  • Structural Operational Semantic
  • Totally Correct Program (Hoare Calculus)
  • Turing Gas
  • Type
  • Weakest Precondition
  • Crash-only Software
  • Digital Red Queen - Adversarial Program Evolution in Core War with LLMs

Created with Quartz v4.4.0 © 2026

  • GitHub