impossibility result
C41039
concept
An impossibility result is a formal theorem showing that no system, algorithm, or method can satisfy a specified set of requirements or achieve a particular goal under given assumptions.
All labels observed (4)
| Label | Occurrences |
|---|---|
| no-go theorem | 5 |
| impossibility result canonical | 2 |
| incomputable prediction scheme | 1 |
| undecidable sentence | 1 |
Description generation (CDg)
The one-sentence description above was generated by prompting gpt-5.1 with the class name and this instruction.
Instruction
generate a one-sentence description for a given conceptual class. # Response Format Return only the sentence: "Description: [one-sentence description of the conceptional class]"
Input
Class: impossibility result
Generated description
An impossibility result is a formal theorem showing that no system, algorithm, or method can satisfy a specified set of requirements or achieve a particular goal under given assumptions.
Instances (9)
| Instance | Via concept surface |
|---|---|
|
Bell’s theorem
surface form:
Bell's theorem
|
no-go theorem |
| FLP impossibility result | — |
| Sen’s liberal paradox | — |
| Coleman–Mandula theorem | no-go theorem |
| Coleman theorem on symmetry breaking in two dimensions | no-go theorem |
| no-cloning theorem | no-go theorem |
| Kochen–Specker theorem | no-go theorem |
| Solomonoff induction | incomputable prediction scheme |
| Rosser sentence | undecidable sentence |