Related papers: Inhabitation for Non-idempotent Intersection Types
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…
The measurements of kinematical endpoints, in cascade decays of supersymmetric particles, in principle allow for a determination of the masses of the unstable particles. However, in this procedure ambiguities often arise. We here illustrate…
In this paper we introduce a typed, concurrent $\lambda$-calculus with references featuring explicit substitutions for variables and references. Alongside usual safety properties, we recover strong normalization. The proof is based on a…
Collision of equilibria with a splitting manifold has been locally studied, but might also be a contributing factor to global bifurcations. In particular a boundary collision can be coincident with collision of a virtual equilibrium with a…
We consider tiling dynamical systems and topological conjugacies between them. We prove that the criterion of being finite type is invariant under topological conjugacy. For substitution tiling systems under rather general conditions,…
The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…
The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions. It is also shown that combining directness and codirectness in Post Embedding problems leads to…
Using recent machine learning results that present an information-theoretic perspective on underfitting and overfitting, we prove that deciding whether an encodable learning algorithm will always underfit a dataset, even if given unlimited…
The existence of an unbounded sequence of solutions to a conformally invariant elliptic equation having nonlocal critical-power nonlinearity is established. The primary obstacle to establishing existence of solutions is the failure of…
History-deterministic automata are those in which nondeterministic choices can be correctly resolved stepwise: there is a strategy to select a continuation of a run given the next input letter so that if the overall input word admits some…
A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the least lambda-theory lambda-beta or the least sensible lambda-theory H (generated by equating…
We consider instabilities of a single mode with finite wavenumber in inversion symmetric spatially one dimensional systems, where the character of the bifurcation changes from sub- to supercritical behaviour. Starting from a general…
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target location within T time units, where T is a constant rational…
This paper deals with the problem of point-to-point reachability in multi-linear systems. These systems consist of a partition of the Euclidean space into a finite number of regions and a constant derivative assigned to each region in the…
We introduce a simple extension of the $\lambda$-calculus with pairs---called the distributive $\lambda$-calculus---obtained by adding a computational interpretation of the valid distributivity isomorphism $A \Rightarrow (B\wedge C)\ \…
Finite-order invariants of knots in arbitrary 3-manifolds (including non-orientable ones) are constructed and studied by methods of the topology of discriminant sets. Obstructions to the integrability of admissible weight systems to…
Let $L_{>\lambda}(\mathcal{A})$ and $L_{\geq\lambda}(\mathcal{A})$ be the languages recognized by {\em measure many 1-way quantum finite automata (MM-QFA)} (or,{\em enhanced 1-way quantum finite automata(EQFA)}) $\mathcal{A}$ with strict…
Resolution and subtyping are two common mechanisms in programming languages. Resolution is used by features such as type classes or Scala-style implicits to synthesize values automatically from contextual type information. Subtyping is…
There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…