We show that the number of t-ary trees with path length equal to p is t h(t-1) tp log2 p(1+o(1)) , where h(x)=-x log2 x-(1-x) log2(1-x) is the binary entropy function. Besides its...
In nonmonotonic reasoning, a default conditional has most often been informally interpreted as a defeasible version of a classical conditional, usually the material conditional...
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Repetitive processes are a distinct class of 2D systems (i.e. information propagation in two independent directions) of both systems theoretic and applications interest. They cann...
Bartlomiej Sulikowski, Krzysztof Galkowski, Eric R...
We argue that computation via quantum mechanical processes is irrelevant to explaining how brains produce thought, contrary to the ongoing speculations of many theorists. First, q...
Abninder Litt, Chris Eliasmith, Frederick W. Kroon...