Any non-trivial semantic property of the partial-computable functions is undecidable — e.g. 'computes total function', 'outputs 42 on input 0'. Generalises the halting problem.
Any non-trivial semantic property of the partial-computable functions is undecidable — e.g. 'computes total function', 'outputs 42 on input 0'. Generalises the halting problem.