In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x1, . . . , xn) ∈ {0, 1}n bit by bit via a channel lim...
An adaptive computation maintains the relationship between its input and output as the input changes. Although various techniques for adaptive computing have been proposed, they r...
We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...
Dana Angluin, Leonor Becerra-Bonache, Adrian Horia...
The NP machine hypothesis posits the existence of an ǫ > 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0∗ but for which no determinist...
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...