enumerable

1.A language is computably enumerable (synonyms: recursively enumerable , semidecidable ) if there is a computable function f such that f(w) is defined if and only if the word w is in the language.

必须开发某种编码系统来允许可计算函数来接受在语任意字作为输入；

2.The framework of knowledge agent, knowledge and knowledge sharing scenario in the model is proposed and designed in detail respectively.Domain of enumerable attributes is also discussed.

对模型知识主体、知识和知识共享情景等3个主要对象设计了相应基本框架,并分析了可枚举属性值域。