Unifying cross-linguistic and within-language patterns of finiteness marking in MOSAIC

MOSAIC, a model that has already simulated cross-linguistic differences in the occurrence of the Optional Infinitive phenomenon, is applied to the simulation of the pattern of finiteness marking within Dutch. This within-language pattern, which includes verb placement, low rates of Optional Infinitives in Wh-questions and the correlation between finiteness marking and subject provision, has been taken as evidence for the view that children have correctly set the clause structure and inflectional parameters for their language. MOSAIC, which employs no built-in linguistic knowledge, clearly simulates the pattern of results as a function of its utterance-final bias, the same mechanism that is responsible for its successful simulation of the crosslinguistic data. These results suggest that both the crosslinguistic and within–language pattern of finiteness marking can be understood in terms of the interaction between a simple resource-limited learning mechanism and the distributional statistics of the input to which it is exposed. Thus, these phenomena do not provide any evidence for abstract or innate knowledge on the part of the child

Taylor expansion for Call-By-Push-Value

The connection between the Call-By-Push-Value lambda-calculus introduced by Levy and Linear Logic introduced by Girard has been widely explored through a denotational view reflecting the precise ruling of resources in this language. We take a further step in this direction and apply Taylor expansion introduced by Ehrhard and Regnier. We define a resource lambda-calculus in whose terms can be used to approximate terms of Call-By-Push-Value. We show that this approximation is coherent with reduction and with the translations of Call-By-Name and Call-By-Value strategies into Call-By-Push-Value

The Clumping Transition in Niche Competition: a Robust Critical Phenomenon

We show analytically and numerically that the appearance of lumps and gaps in the distribution of n competing species along a niche axis is a robust phenomenon whenever the finiteness of the niche space is taken into account. In this case depending if the niche width of the species $\sigma$ is above or below a threshold $\sigma_c$, which for large n coincides with 2/n, there are two different regimes. For $\sigma > sigma_c$ the lumpy pattern emerges directly from the dominant eigenvector of the competition matrix because its corresponding eigenvalue becomes negative. For $\sigma </- sigma_c$ the lumpy pattern disappears. Furthermore, this clumping transition exhibits critical slowing down as $\sigma$ is approached from above. We also find that the number of lumps of species vs. $\sigma$ displays a stair-step structure. The positions of these steps are distributed according to a power-law. It is thus straightforward to predict the number of groups that can be packed along a niche axis and it coincides with field measurements for a wide range of the model parameters.Comment: 16 pages, 7 figures; http://iopscience.iop.org/1742-5468/2010/05/P0500

Electroweak corrections to Higgs production through ZZ fusion at the linear collider

We present the full order alpha electroweak radiative corrections to e+e- -> e+e-H. The computation is performed with the help of GRACE-loop. The extraction of the full QED corrections is performed, these are quite large at threshold. The genuine weak corrections, for the linear collider energies, when expressed in the G_mu scheme are of order -2 to -4 for Higgs masses preferred by the latest precision data. We also extract the m_t^2 type corrections and make a comparison with the weak corrections for the process e+e- ->nu nu H.Comment: 16 pages and 6 figure

On the capacities of bipartite Hamiltonians and unitary gates

We consider interactions as bidirectional channels. We investigate the capacities for interaction Hamiltonians and nonlocal unitary gates to generate entanglement and transmit classical information. We give analytic expressions for the entanglement generating capacity and entanglement-assisted one-way classical communication capacity of interactions, and show that these quantities are additive, so that the asymptotic capacities equal the corresponding 1-shot capacities. We give general bounds on other capacities, discuss some examples, and conclude with some open questions.Comment: V3: extensively rewritten. V4: a mistaken reference to a conjecture by Kraus and Cirac [quant-ph/0011050] removed and a mistake in the order of authors in Ref. [53] correcte

Confluence via strong normalisation in an algebraic \lambda-calculus with rewriting

The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while the latter uses equalities. When given by rewrites, algebraic lambda-calculi are not confluent unless further restrictions are added. We provide a type system for the linear-algebraic lambda-calculus enforcing strong normalisation, which gives back confluence. The type system allows an abstract interpretation in System F.Comment: In Proceedings LSFA 2011, arXiv:1203.542