|
2 |
edited tags
|
||
|
1 |
|
||
Is equality of terms for "real" numbers with roots, logarithm, exponential, sin, cos, and other trigonometric operations decidable with a Turing-machine?If yes, how? Also, I know you can't do it for arbitrary statements about real numbers, but that's not what I'm asking, and by "real" numbers, I mean the numbers constructible from 1, -, /, and the operations mentioned in the title. Also, I don't care about numbers that can't be constructed from said operations and constant.
|
||||

