Scholarlink

In the first part of the book, we investigate the problem of computable presentability for spaces and algebraic structures. Much of the theory revolves around a few basic definitions of computability that are tested and compared in various natural classes of mathematical structures. In the next few sections we will meet the main players in this book, and also give some of the main motivating themes. We will always bear in mind our central theme of unifying the countable and uncountable.

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

Introduction

  • 章节

  • 发表日期：

    2026年

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

摘要

In the first part of the book, we investigate the problem of computable presentability for spaces and algebraic structures. Much of the theory revolves around a few basic definitions of computability that are tested and compared in various natural classes of mathematical structures. In the next few sections we will meet the main players in this book, and also give some of the main motivating themes. We will always bear in mind our central theme of unifying the countable and uncountable.