Come learn food tongue, a language in which every word is a food, by immersion!

Mint-apple sauce food tongue. Pear spinach sauce food tongue. Pear wonton pasta-peach-sauce food tongue? Pear shrimp kumquat plantain mint-apple clam peach-sauce pear!

In formal maths-language, I might say: this class will show the existence of an infinite computable subtree of the infinite binary tree possessing no infinite computable path. In normal talk, what that means is this. A computer has a program loaded in its memory; the program allows it to compute a giant, branching tree. Specifically, the program specifies how many children each node has: 0, 1, or 2. The tree continues to arbitrary depth; however, no matter how you program the computer, it will not be able to find a path through this tree that doesn't eventually run into a dead end. How is this possible? We will see!