Scholarlink

The goal of this section is to accumulate sufficient computability-theoretic techniques to derive our group-theoretic results. The seemingly elementary class of computable equivalence relations will be quite unexpectedly useful in such applications.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Enumerating structures without repetition

  • 章节

  • 发表日期：

    2026年

查看全文
  • Rodney G. Downey,
  • Alexander Melnikov

摘要

The goal of this section is to accumulate sufficient computability-theoretic techniques to derive our group-theoretic results. The seemingly elementary class of computable equivalence relations will be quite unexpectedly useful in such applications.