LogoLogo
1.0.0
  • Home
  • Install
  • Docs
  • Contribute
  • Journey
  • 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. Writing Varphi Programs
  2. More Examples

Coin Flip

Below is an example of a nondeterministic Varphi program that, when given an input tape containing exactly one tally, returns an output tape containing one or two tallies. 

qStart 1 qHeads 0 R
qStart 1 qTails 0 R

qHeads 0 qWrite1 0 R
qTails 0 qWrite2 0 R

qWrite1 0 qHalt 1 R
qWrite2 0 qWrite1 1 R

PreviousRock, Paper, ScissorsNextThe Unary Number System

Last updated 4 months ago

Was this helpful?