Constructive induction divides the problem of learning an inductive hypothesis into two intertwined searches: one—for the “best” representation space, and two—for the “be...
We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the numb...
The purpose of this paper is to decipher constructively a lemma of Suslin which played a central role in his second solution of Serre's problem on projective modules over pol...
We present a new self-reproducing cellular automaton capable of construction and computation beyond self-reproduction. Our automaton makes use of some of the concepts developed by...
We present our efforts to create a large-scale, semi-automatically annotated parallel corpus of cleft constructions. The corpus is intended to reduce or make more effective the ma...