
Addition Machines, Automatic Functions and Open Problems of Floyd and Knuth
Floyd and Knuth investigated in 1990 register machines which can add, su...
read it

Alternating Automatic Register Machines
This paper introduces and studies a new model of computation called an A...
read it

Improved Algorithms for the General Exact Satisfiability Problem
The Exact Satisfiability problem asks if we can find a satisfying assign...
read it

Learnability and Positive Equivalence Relations
Prior work of Gavryushkin, Khoussainov, Jain and Stephan investigated wh...
read it

A Faster Exact Algorithm to Count X3SAT Solutions
The Exact Satisfiability problem, XSAT, is defined as the problem of fin...
read it

A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT
X3SAT is the problem of whether one can satisfy a given set of clauses w...
read it

Random Subgroups of Rationals
This paper introduces and studies a notion of algorithmic randomness for...
read it

Equivalences between learning of data and probability distributions, and their applications
Algorithmic learning theory traditionally studies the learnability of ef...
read it

Algorithmic learning of probability distributions from random data in the limit
We study the problem of identifying a probability distribution for some ...
read it

Closure of resourcebounded randomness notions under polynomial time permutations
An infinite bit sequence is called recursively random if no computable s...
read it
Frank Stephan
is this you? claim profile