首页> 外文期刊>Journal of Mathematical Sciences >ON THE MARKOV THEOREM ON ALGORITHMIC NONRECOGNIZABILITY OF MANIFOLDS
【24h】

ON THE MARKOV THEOREM ON ALGORITHMIC NONRECOGNIZABILITY OF MANIFOLDS

机译:关于流形的算法不可识别性的马尔可夫定理

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

We prove that the number of summands in the connected union of products of spheres which is algorithmically nonrecognizable, as was shown earlier, can be reduced to 14. Also, we note that the manifold constructed by Markov himself in his original work on topological nonrecognizability coincides with such a union (where the number of summands is equal to the quantity of relations in group representations of the corresponding Adian sequence).
机译:我们证明,如前所述,在算法上无法识别的球积连接的并集中的求和数可以减少到14。而且,我们注意到,马尔科夫本人在其关于拓扑不可识别性的原始工作中构造的流形是重合的使用这样的并集(其中求和的数量等于对应的Adian序列的组表示中的关系的数量)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号