Search Results for author:
Found 4 papers, 0 papers with code
Ordered Semiautomatic Rings with Applications to Geometry
The present work looks at semiautomatic rings with automatic addition and comparisons which are dense subrings of the real numbers and asks how these can be used to represent geometric objects such that certain operations and transformations are automatic.
Formal Languages and Automata Theory Logic
Improved Algorithms for the General Exact Satisfiability Problem
The Exact Satisfiability problem asks if we can find a satisfying assignment to each clause such that exactly one literal in each clause is assigned $1$, while the rest are all assigned $0$.
Data Structures and Algorithms
Algorithmic learning of probability distributions from random data in the limit
We study the problem of identifying a probability distribution for some given randomly sampled data in the limit, in the context of algorithmic learning theory as proposed recently by Vinanyi and Chater.
Combining Models of Approximation with Partial Learning
Here three variants of approximate learning will be introduced and investigated with respect to the question whether they can be combined with partial learning.
