Search Results for author:
Found 3 papers, 0 papers with code
A Computability Perspective on (Verified) Machine Learning
There is a strong consensus that combining the versatility of machine learning with the assurances given by formal verification is highly desirable.
Adaptive Neighbourhoods for the Discovery of Adversarial Examples
Deep Neural Networks (DNNs) have often supplied state-of-the-art results in pattern recognition tasks.
Finding descending sequences through ill-founded linear orders
In this work we investigate the Weihrauch degree of the problem $\mathsf{DS}$ of finding an infinite descending sequence through a given ill-founded linear order, which is shared by the problem $\mathsf{BS}$ of finding a bad sequence through a given non-well quasi-order.
Logic Logic in Computer Science Combinatorics 03D30 03D78 06A75
