Notations for exponentiation
نویسنده
چکیده
We define a coding of natural numbers – which we will call exponential notations – and interpretations of the less-than-relation, the successor, addition and exponentiation function on exponential notations. We prove that all these interpretations are polynomial time computable. As a corollary we obtain that feasible arithmetic can prove the consistency of the canonical equational theory for the language containing the successor, addition and exponentiation function.2
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملAn overview of the ordinal calculator
An ordinal calculator has been developed as an aid for understanding the countable ordinal hierarchy and as a research tool that may eventually help to expand it. A GPL licensed version is available in C++. It is an interactive command line calculator and can be used as a library. It includes notations for the ordinals uniquely expressible in Cantor normal form, the Veblen hierarchies and a for...
متن کاملArchitecture of a Quantum Multicomputer Optimized for Shor’s Factoring Algorithm
Quantum computers exist, and offer tantalizing possibilities of dramatic increases in computational power, but scaling them up to solve problems that are classically intractable offers enormous technical challenges. Distributed quantum computation offers a way to surpass the limitations of an individual quantum computer. I propose a quantum multicomputer as a form of distributed quantum compute...
متن کاملThe Geometry of Frobenioids I: the General Theory
ion is analogous to the role of Galois categories in Galois theory or monoids in the geometry of log schemes. This abstract category-theoretic framework preserves many of the important features of the classical theory of divisors and line bundles on models of finite separable extensions of a function field or number field such as the global degree of an arithmetic line bundle over a number fiel...
متن کاملConstructive Versions of Ordinal Number Classes
0. Introduction and summary. Almost from its beginning, the theory of ordinal numbers has included results which can, in a rather concrete sense, be viewed as theorems about notations for ordinal numbers. For example the theorems on polynomial normal forms for those ordinals that lie below the least e number can be understood as providing a certain unique notation of finite length for each such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 288 شماره
صفحات -
تاریخ انتشار 2002