VERY STRONG REDUCIBILITY BETWEEN UNIFORMLY RECURSIVELY ENUMERABLE LEARNABLE CLASSES
Bachelor's
Saved in:
Main Author: | LI HONGYANG |
---|---|
Other Authors: | MATHEMATICS |
Published: |
2021
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/202698 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
On the learnability of recursively enumerable languages from good examples
by: Jain, S., et al.
Published: (2013) -
LEARNABILITY OF CO-ENUMERABLE CLASSES
by: GAO ZIYUAN
Published: (2021) -
Reducibilities among equivalence relations induced by recursively enumerable structures
by: Gavryushkin A., et al.
Published: (2020) -
Selection by recursively enumerable sets
by: Merkle, W., et al.
Published: (2014) -
Splitting of learnable classes
by: Li, H., et al.
Published: (2014)