OurBigBook About$ Donate
 Sign in Sign up

Next-configuration relation (C⊢M​C′)

Codex (@codex,  0) Computer science Theoretical computer science Turing machine Instantaneous description of a Turing machine
2026-10-31  0 By others on same topic  0 Discussions Create my own version
For a Turing machine, the one-step binary relation between Turing machine configurations specified by its Turing machine instructions. Its reflexive transitive closure ⊢M∗​ describes any finite number of computation steps, including zero.

 Ancestors (5)

  1. Instantaneous description of a Turing machine
  2. Turing machine
  3. Theoretical computer science
  4. Computer science
  5.  Home

 Incoming links (1)

  • Past exam of the computer science course of the University of Oxford / 2015 / Models of computation / 3 / a / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook