Bifalgorithm post · Brisk · Chapter 1

Is H transitive?

Is H transitive? (Brisk · Chapter 1) — "H is an endorelation on T, defined as follows: { (Kirk, Kirk), (Spock, Spock), (Uhura, Scotty), (Scotty, Uhura), (Spock…

Ideas in this flowchart

H es una endorrelación transitiva sobre T.
H está definida mediante un conjunto de pares ordenados.
El conjunto contiene los pares ordenados especificados.
Incluye los pares reflexivos (Kirk, Kirk), (Spock, Spock), (Scotty, Scotty) y (Uhura, Uhura).
Incluye los pares recíprocos (Uhura, Scotty) y (Scotty, Uhura).
Incluye los pares recíprocos (Spock, McCoy) y (McCoy, Spock).
La transitividad se justifica porque no hay ejemplos de pares (x, y) y (y, z) presentes simultáneamente.

Bifalgorithm

Feed/

Is H transitive?

Channel

Brisk

1 page

USR292600b83e2a

Ebook3w

"H is an endorelation on T, defined as follows: { (Kirk, Kirk), (Spock, Spock), (Uhura, Scotty), (Scotty, Uhura), (Spock, McCoy), (McCoy, Spock), (Scotty, Scotty), (Uhura, Uhura) }. H is transitive because there are not any examples of (x, y) and (y, z) pairs both being present."

Flowchart preview

👍

0 comments0 shares