Sciweavers

50 search results - page 1 / 10
» Definable encodings in the computably enumerable sets
Sort
View
BSL
2000
88views more  BSL 2000»
14 years 10 months ago
Definable encodings in the computably enumerable sets
Peter Cholak, Leo Harrington
CORR
2008
Springer
113views Education» more  CORR 2008»
14 years 10 months ago
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
Paul Tarau
65
Voted
BSL
2008
97views more  BSL 2008»
14 years 10 months ago
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
Peter Cholak, Rodney G. Downey, Leo Harrington
GLOBECOM
2007
IEEE
15 years 4 months ago
Ensemble Enumerators for Protograph-Based Generalized LDPC Codes
— Protograph-based LDPC codes have the advantages of a simple design (or search) procedure and highly structured encoders and decoders. These advantages have also been exploited ...
Shadi Abu-Surra, William E. Ryan, Dariush Divsalar
CCS
2006
ACM
15 years 1 months ago
RoleMiner: mining roles using subset enumeration
Role engineering, the task of defining roles and associating permissions to them, is essential to realize the full benefits of the role-based access control paradigm. Essentially,...
Jaideep Vaidya, Vijayalakshmi Atluri, Janice Warne...