Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
20
click to vote
BSL
2000
favorite
Email
discuss
report
88
views
more
BSL 2000
»
Definable encodings in the computably enumerable sets
13 years 8 months ago
Download
www.nd.edu
Peter Cholak, Leo Harrington
Real-time Traffic
BSL 2000
|
claim paper
Related Content
»
A Functional Hitchhikers Guide to Hereditarily Finite Sets Ackermann Encodings and Pairing...
»
The Complexity of Orbits of Computably Enumerable Sets
»
Ensemble Enumerators for ProtographBased Generalized LDPC Codes
»
RoleMiner mining roles using subset enumeration
»
Parallel OutofCore Algorithm for GenomeScale Enumeration of Metabolic Systemic Pathways
»
Lossless Data Compression via Substring Enumeration
»
Discovering Sequence Similarity by the Algorithmic Significance Method
»
Hilbert functions of ladder determinantal varieties
»
Absolute versus probabilistic classification in a logical setting
more »
Post Info
More Details (n/a)
Added
17 Dec 2010
Updated
17 Dec 2010
Type
Journal
Year
2000
Where
BSL
Authors
Peter Cholak, Leo Harrington
Comments
(0)
Researcher Info
BSL 2008 Study Group
Computer Vision