LogoLogo
1.0.0
1.0.01.1.0
  • Home
  • Install
  • Docs
  • Contribute
  • Journey
1.0.0
1.0.01.1.0
  • Welcome
  • The Varphi Language Standard
    • Welcome
    • State Names
    • Tallies and Blanks
    • Head Directions
    • Lines
    • Comments
    • Varphi Programs
    • Addressing Ambiguities
  • Writing Varphi Programs
    • Your First Varphi Program
    • Running Varphi Programs
    • Debugging Varphi Programs
    • The Varphi VS Code Extension
    • Good Practices
    • More Examples
      • Addition By One
      • Add Two Numbers
      • Multiplication By Two
      • Rock, Paper, Scissors
      • Coin Flip
  • Turing Machine Theory
    • The Unary Number System
    • Turing Machine Tapes
    • Turing Machine Heads
    • Turing Machine States
    • Turing Machines
    • Nondeterministic Turing Machines
Powered by GitBook
LogoLogo

© 2025 Hassan El-Sheikha

On this page

Was this helpful?

Edit on GitHub
Export as PDF
  1. The Varphi Language Standard

Varphi Programs

PreviousCommentsNextAddressing Ambiguities

Last updated 2 months ago

Was this helpful?

Varphi programs are extemely simple. They consist of , separated by newlines. They can also include .

Varphi supports both deterministic and . Nondeterministic programs have two or more lines with the same condition, but with different instructions.

lines
comments
nondeterministic Turing programs