Bridging Computational Notions of Depth: Members of Deep Classes
2025-1-16 01:9:44 Author: hackernoon.com(查看原文) 阅读量:1 收藏

Open TLDRtldt arrow

Too Long; Didn't Read

Introducing the members of deep classes and proving that they are strongly deep.

featured image - Bridging Computational Notions of Depth: Members of Deep Classes

Computational Technology for All HackerNoon profile picture

0-item

Abstract and 1 Introduction

2 Background

3 On the slow growth law

4 Members of Deep Π0 1 classes

5 Strong depth is Negligible

6 Variants of Strong Depth

References

Appendix A. Proof of Lemma 3

By Lemma 3, we can conclude that X is order-deep.

One immediate consequence of Theorem 9 is the following.

The converse of this result does not hold.

As an immediate consequence of Theorem 9 and the above results from [BP16], we have:

Next, we have:

This paper is available on arxiv under CC BY 4.0 DEED license.

Authors:

(1) Laurent Bienvenu;

(2) Christopher P. Porter.


文章来源: https://hackernoon.com/bridging-computational-notions-of-depth-members-of-deep-classes?source=rss
如有侵权请联系:admin#unsafe.sh