Related papers: On Functions Weakly Computable by Pushdown Petri N…
Vector addition systems with states (VASS), also known as Petri nets, are a popular model of concurrent systems. Many problems from many areas reduce to the reachability problem for VASS, which consists of deciding whether a target…
Tame functions are a class of nonsmooth, nonconvex functions, which feature in a wide range of applications: functions encountered in the training of deep neural networks with all common activations, value functions of mixed-integer…
In this paper we study the problem of extending functions with values in a locally convex Hausdorff space $E$ over a field $\mathbb{K}$, which have weak extensions in a weighted Banach space $\mathcal{F}\nu(\Omega,\mathbb{K})$ of…
Weak-value amplification (WVA) has recently become an important technique for parameter estimation, owing to its ability to enhance the signal-to-noise ratio by amplifying extremely small signals with proper postselection strategies. In…
Weak-head normalization is inconsistent with functional extensionality in the call-by-name $\lambda$-calculus. We explore this problem from a new angle via the conflict between extensionality and effects. Leveraging ideas from work on the…
Hankel matrices (aka connection matrices) of word functions and graph parameters have wide applications in automata theory, graph theory, and machine learning. We give a characterization of real-valued functions on nested words recognized…
Submodular functions are well-studied in combinatorial optimization, game theory and economics. The natural diminishing returns property makes them suitable for many applications. We study an extension of monotone submodular functions,…
This paper concerns algorithms that give correct answers with (asymptotic) density $1$. A dense description of a function $g : \omega \to \omega$ is a partial function $f$ on $\omega$ such that $\left\{n : f(n) = g(n)\right\}$ has density…
The weak value amplification technique has been proved useful for precision metrology in both theory and experiment. To explore the ultimate performance of weak value amplification for multi-parameter estimation, we investigate a general…
Finite automata whose computations can be reversed, at any point, by knowing the last k symbols read from the input, for a fixed k, are considered. These devices and their accepted languages are called k-reversible automata and k-reversible…
It is shown that any Hermitian operator can be expanded in terms of a set of operators formed from biorthogonal basis, and the expansion coefficients are given as products of weight functions and weak values, shedding a new light on the…
Vector addition systems with states (VASS) are widely used for the formal verification of concurrent systems. Given their tremendous computational complexity, practical approaches have relied on techniques such as reachability relaxations,…
We investigate the dimension-parametric complexity of the reachability problem in vector addition systems with states (VASS) and its extension with pushdown stack (pushdown VASS). Up to now, the problem is known to be $\mathcal{F}_k$-hard…
The function $P(T)=\sum_{i=0}^\infty c_i T^i$ is admissible if $c_i\geq 0$, $\sum_{i=0}^\infty c_i\leq 1$. For any given set of admissible functions $P_1,\dots, P_k$ there is a unitary operator $T$ of dynamic origin such that the weak…
We show using statistically rigorous arguments that the technique of weak value amplification (WVA) does not perform better than standard statistical techniques for the tasks of single parameter estimation and signal detection. Specifically…
Weak value amplification (WVA) is a technique in which one can magnify the apparent strength of a measurement signal. Some have claimed that WVA can outperform more conventional measurement schemes in parameter estimation. Nonetheless, a…
We define guarded variable automata (GVAs), a simple extension of finite automata over infinite alphabets. In this model the transitions are labelled by letters or variables ranging over an infinite alphabet and guarded by conjunction of…
An integer additive set-indexer (IASI) is defined as an injective function $f:V(G)\rightarrow \mathcal{P}(\mathbb{N}_0)$ such that the induced function $f^+:E(G) \rightarrow \mathcal{P}(\mathbb{N}_0)$ defined by $f^+ (uv) = f(u)+ f(v)$ is…
Weak value amplification (WVA) is a metrological protocol that amplifies ultra-small physical effects. However, the amplified outcomes necessarily occur with highly suppressed probabilities, leading to the extensive debate on whether the…
We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak Konig's Lemma within the…