Rare card
List of undecidable problems
- Value
- 50 W
- Attack
- 740
- Defence
- 592
- Players
- 0
In computability theory, an undecidable problem is a decision problem for which an effective method (algorithm) to derive the correct answer does not exist. More formally, an undecidable problem is a problem whose language is not a recursive set; see the article Decidable language.
Get List of undecidable problems in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack