Embedding Finite Lattices into The Ideals of Computably Enumerable Turing Degrees.
William C. CalhounManuel LermanPublished in: J. Symb. Log. (2001)
Keyphrases
- unit length
- vector space
- inductive inference
- finite number
- machine intelligence
- robust image watermarking
- real time
- finite automata
- multidimensional scaling
- error correction
- data hiding
- concept lattice
- partially ordered
- digital images
- reinforcement learning
- turing machine
- reversible data hiding
- information systems
- information retrieval