Computational Complexity over thep-adic Numbers
نویسندگان
چکیده
منابع مشابه
Computational Complexity on Signed Numbers
This paper presents a new representation of natural numbers and discusses its consequences for computability and computational complexity. The paper argues that the introduction of the first Peano axiom in the traditional definition of natural numbers is not essential. It claims that natural numbers remain usable in traditional ways without assuming the existence of at least one natural number....
متن کاملThe Complexity of the Theory of p-adic Numbers
This paper addresses the question of the complexity of the decision problem for the theory Th(Q,) of p-ad ic numbers. The best known lower bound for the theory is double exponential alternating time with a linear number of alternations. I have designed an algorithm that determines the truth value of sentences of the theory requiring double exponential space. My algorithm is based on techniques ...
متن کاملDIGRAPH REPRESENTATIONS OF RATIONAL FUNCTIONS OVER THE p-ADIC NUMBERS
In this paper, we construct a digraph structure on padic dynamical systems defined by rational functions. We study the conditions under which the functions are measure-preserving, invertible and isometric, ergodic, and minimal on invariant subsets, by means of graph theoretic properties.
متن کاملOn Weak-Space Complexity over Complex Numbers
Defining a feasible notion of space over the Blum-Shub-Smale (BSS) model of algebraic computation is a long standing open problem. In an attempt to define a right notion of space complexity for the BSS model, Naurois [CiE, 2007] introduced the notion of weak-space. We investigate the weak-space bounded computations and their plausible relationship with the classical space bounded computations. ...
متن کاملComputable p–adic Numbers
In the present work the notion of the computable (primitive recursive, polynomially time computable) p–adic number is introduced and studied. Basic properties of these numbers and the set of indices representing them are established and it is proved that the above defined fields are p–adically closed. Using the notion of a notation system introduced by Y. Moschovakis an abstract characterizatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1997
ISSN: 0885-064X
DOI: 10.1006/jcom.1997.0441