Encyclopedia/All topics/LNAL

LNAL

Articles 1–19 of 19. Alphabetical by title.

• Lnal Instr Cost

  Every computation step in the framework's machine model carries a fixed price; this table sets those prices.

• Lnal Instr Cost Instr Cost

  A small table in a machine-checked library assigns a recognition cost to each primitive instruction, and the table's meaning is narrower than it looks.

• Lnal Opcodes

  Eight primitive operations, from LOCK to FLIP, form the instruction set that Recognition Science uses to model how a ledger of events is manipulated.

• Lnal Opcodes Balance Mode

  A two-way switch in the framework's instruction set that tells the BALANCE primitive whether to reset a short accounting window or an entire recognition cycle.

• Lnal Opcodes Listen Mode

  ListenMode is a two-way switch on the LISTEN instruction that tells the ledger whether to simply observe a token or to reset its vector state.

• Lnal Opcodes Opcode Arg

  OpcodeArg is the small set of optional modifiers that attach to the eight primitive instructions of the LNAL machine code, giving each one a precise, machine-checked meaning.

• Lnal Opcodes Token Action

  TokenAction is a small vocabulary for changing a number in a ledger: add to it, or set it to a new value, with an optional cost.

• Lnal Registers

  A recognition process keeps its working state in a fixed set of numbered slots: six core registers and five auxiliary registers.

• Lnal Registers Aux5

  Aux5 is a five-field data structure that tracks neighbor sums, token counts, hydration, and phase state in a recognition ledger.

• Lnal Registers I32 Range

  A signed 32-bit integer range is the guardrail that keeps a Recognition Science virtual machine's execution state from overflowing.

• Lnal Registers Parity Invariant

  A single equation ties together two seemingly separate numbers in a computation register, enforcing a consistency rule that keeps the machine's bookkeeping honest.

• Lnal Registers Reg6

  Reg6 is a six-field data structure that tracks the state of a computation, not a physical law, and its well-formedness is a formal constraint, not a discovery.

• Lnal Registers Well Formed

  A register is a small box of numbers; being well-formed means the numbers stay in range and obey one parity rule.

• Lnal Vm

  A small formal computer that runs recognition events in discrete steps, with a proved guarantee that it always advances and never exhausts its budget.

• Lnal Vm Eight Beat Alignment Detail

  A machine-checked definition that records the exact rhythm of an eight-step recognition cycle, without claiming the cycle itself is physically real.

• Lnal Vm Eight Beat Alignment Invariant

  A machine-checked proof that a simple two-instruction program, run on a small virtual machine, always keeps its internal bookkeeping aligned in repeating eight-step windows.

• Lnal Vm L Step Core Breath

  A small machine-checked theorem about a virtual machine's clock keeps a recognition cycle from running away.

• Lnal Vm Preservation Breath

  A small theorem in a machine-checked library proves a virtual machine's energy counter never overflows its 1024-step window, no matter what program runs.

• Lnal Vm Progress

  A machine-checked theorem about a small virtual machine proves that its execution can never get stuck, and the proof itself is part of the framework's claim to exactness.