Sign inSign in

Tableau

One word, taught differently in 2 fields. Each use is given apart.

In Theory & Algos

A table representing the computation history of a Turing machine on an input.
as Michael Sipser defines itMITThe wording closest to all 3 definitions

In Literature

A table used in optimality theory representing the interplay between different ranked constraints and candidate outputs.

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

In Theory & Algos

2

Each in their own terms, from the easiest level.

  • Michael Sipser

    MIT · Undergraduate

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    The complete grid of all configurations of a Turing machine computation over time, used to construct equivalent boolean circuits.
    • 33:54From P-Completeness to PSPACE-Completeness

In Literature

1

    Connections

    14

    The lectures that define it or assume it, and the concepts next to it.

    3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.