Non-Computability (Tiling Problems)

Definition

The principle that certain mathematical problems have definite yes-or-no answers but are not solvable by any algorithm; the tiling problem exemplifies this: given a finite set of tile shapes, whether they can cover an infinite plane is definite yet non-computable.

Cast within

No topic-region cast yet — this appears once Non-Computability (Tiling Problems)'s compiled claims are aligned into a topic region's argument tree.

Claims mentioning Non-Computability (Tiling Problems) (1)

Your notes

Loading notes...