New answers tagged

0 votes

Decidability of transcendental numbers

As a (hopefully fun) exercise, we show that the problem is complete for $\Pi_2$ (under many-one reductions). That is, equivalent to determining whether a given TM halts on all inputs. (This is ...
Neal Young's user avatar
  • 10.1k

Top 50 recent answers are included