A polynomial-time computable curve whose interior has a nonrecursive measure
نویسندگان
چکیده
منابع مشابه
Multicommunicating: a Practice Whose Time Has Come?
We offer the concept of multicommunicating to describe overlapping conversations, an increasingly common occurrence in the technology-enriched workplace. We define multicommunicating, distinguish it from other behaviors, and develop propositions for future research. Our work extends the literature on technology-stimulated restructuring and reveals one of the opportunities provided by lean media...
متن کاملPolynomial time computable real functions
In this paper, we study computability and complexity of real functions. We extend these notions, already defined for functions over closed intervals or over the real line to functions over particular real open sets and give some results and characterizations, especially for polynomial time computable functions. Our representation of real numbers as sequences of rational numbers allows us to imp...
متن کاملOn Polynomial Time Computable Numbers
The computable numbers have already appeared in Turing’s paper [6] in which he defined the Turing machine. Turing defined them in real numbers, the definition is naturally extended to complex numbers. Rice showed that the whole complex computable numbers forms an algebraically closed field [4]. The field is strictly larger than the algebraic number fields Q since it contains transcendental numb...
متن کاملA computably categorical structure whose expansion by a constant has infinite computable dimension
Cholak, Goncharov, Khoussainov, and Shore [J. Symbolic Logic 64 (1999) 13– 37] showed that for each k > 0 there is a computably categorical structure whose expansion by a constant has computable dimension k. We show that the same is true with k replaced by ω. Our proof uses a version of Goncharov’s method of left and right operations. ∗Partially supported by an Alfred P. Sloan Doctoral Disserta...
متن کاملA presentation of general multipersistence modules computable in polynomial time?
Multipersistence homology modules were introduced by G.Carlsson and A.Zomorodian [1] which gave, together with G.Singh [4], an algorithm to compute their Gröbner bases. Although their algorithm has polynomial complexity when the chain modules are free, i.e. in the one-critical case, it might be exponential in general. We give a new presentation of multipersistence homology modules, which allows...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00154-b