منابع مشابه
An Arithmetical Characterization of the Convex Hull of Digital Straight Segments
In this paper, we arithmetically describe the convex hull of a digital straight segment by three recurrence relations. This characterization gives new insights into the combinatorial structure of digital straight segments of arbitrary length and intercept. It also leads to two on-line algorithms that computes a part of the convex hull of a given digital straight segment. They both run in consta...
متن کاملComparing Constructive Arithmetical Theories Based on NP-PIND and coNP-PIND
In this note we show that the intuitionistic theory of polynomial induction on Π 1 -formulas does not imply the intuitionistic theory IS 1 2 of polynomial induction on Σ 1 -formulas. We also show the converse assuming the Polynomial Hierarchy does not collapse. Similar results hold also for length induction in place of polynomial induction. We also investigate the relation between various other...
متن کاملStatistical Characterization of NP-Complete Problems
NP-complete problems fall into a range of difficulty and it is of considerable interest to identify the general characteristics of these problems that account for this difference. A method for measuring problem difficulty is developed based on the amount of time it takes to find an optimal solution. This reveals that there are layers of difficulty and that any NP-complete problem can be separat...
متن کاملA characterization of the arithmetical hierarchy by language equations
Language equations with all Boolean operations and concatenation and a particular order on the set of solutions are proved to be equal in expressive power to the first-order Peano arithmetic. In particular, it is shown that the class of sets representable using k variables (for every k > 2) is exactly the k-th level of the arithmetical hierarchy, i.e., the sets definable by recursive predicates...
متن کاملArithmetical Knowledge and Arithmetical Definability: Four Studies
by Sean Walsh The subject of this dissertation is arithmetical knowledge and arithmetical definability. The first two chapters contain respectively a critique of a logicist account of a preferred means by which we may legitimately infer to arithmetical truths and a tentative defense of an empiricist account. According to the logicist account, one may infer from quasi-logical truths to patently ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1982
ISSN: 0304-3975
DOI: 10.1016/0304-3975(82)90076-7