no code implementations • 11 Mar 2021 • ZiYuan Gao, Sanjay Jain, Ji Qi, Philipp Schlicht, Frank Stephan, Jacob Tarr
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
no code implementations • 21 Jan 2021 • Gordon Hoi, Frank Stephan
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
no code implementations • 31 Oct 2017 • George Barmpalias, Frank Stephan
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.
no code implementations • 5 Jul 2015 • Zi-Yuan Gao, Frank Stephan, Sandra Zilles
Here three variants of approximate learning will be introduced and investigated with respect to the question whether they can be combined with partial learning.