Non-recursiveness of the operations on real numbers
Theoretical Computer Science
Complexity theory of real functions
Complexity theory of real functions
Relaxed p-adic Hensel lifting for algebraic systems
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
| Hi-index | 0.00 |
Based on the notion of a computable p-adic number the notion of a polynomially time computable function over the field of p-adic numbers is introduced and studied. Theorems relating analytical properties with computability properties are established. The complexity of roots, and inverse function theorems are established at the level of polynomial time complexity. Relations between differentiability and polynomial time complexity and the maximization problem are discussed. Differences and similarities between the analogous questions for the real numbers are pointed out.