Every nontrivial extensional property of partial computable functions or computably enumerable languages is undecidable.
Ancestors (6)
Incoming links (16)
- Function in extension
- Infinite-domain range-restriction index set
- Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 25 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 27 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2009 / iii / Paper 25 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2010 / iii / Paper 20 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2012 / iii / Paper 24 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 120 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2018 / ii / Paper 4 / 4G / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2018 / ii / Paper 4 / 4G / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / ii / Paper 3 / 12H / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / ii / Paper 3 / 12H / e / Solution
- Past exam of the mathematics course of the University of Cambridge / 2022 / ii / Paper 1 / 4I / Solution
- Past exam of the mathematics course of the University of Cambridge / 2024 / ii / Paper 2 / 4J / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2024 / ii / Paper 2 / 4J / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2025 / ii / Paper 1 / 12F / b / Solution
Discussion (0)
New discussionThere are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.