Sciweavers

429 search results - page 46 / 86
» Turing computations on ordinals
Sort
View
APAL
2010
124views more  APAL 2010»
14 years 10 months ago
The effective theory of Borel equivalence relations
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-K...
Ekaterina B. Fokina, Sy-David Friedman, Asger T&ou...
MCU
1998
119views Hardware» more  MCU 1998»
14 years 11 months ago
DNA Computing Based on Splicing: Universality Results
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
Gheorghe Paun
CIE
2007
Springer
15 years 3 months ago
Binary Trees and (Maximal) Order Types
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
Gyesik Lee
ICSE
1993
IEEE-ACM
15 years 1 months ago
Rule-Based Approach to Computing Module Cohesion
Stevens, Myers, and Constantine introduced the notion of cohesion, an ordinal scale of seven levels that describes the degree to which the actions performed by a module contribute...
Arun Lakhotia
CIA
2006
Springer
15 years 1 months ago
The Distortion of Cardinal Preferences in Voting
The theoretical guarantees provided by voting have distinguished it as a prominent method of preference aggregation among autonomous agents. However, unlike humans, agents usually ...
Ariel D. Procaccia, Jeffrey S. Rosenschein