相关论文: Small Jump with Negation-UTM Trampoline

Recently de La Torre et al. [1] reconstructed Quantum Theory from its local structure on the basis of local discriminability and the existence of a one-parameter group of bipartite transformations containing an entangling gate. This result…

Dynamic topological logic (DTL) is a polymodal logic designed for reasoning about {\em dynamic topological systems. These are pairs (X,f), where X is a topological space and f:X->X is continuous. DTL uses a language L which combines the…

Let $P_r(n)$ be the set of partitions of n with non negative rth differences. Let $\lambda$ be a partition chosen uniformly at random among the set $P_r(n)$. Let $d(\lambda)$ be a positive rth difference chosen uniformly at random in…

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

We prove a robust super-hedging duality result for path-dependent options on assets with jumps, in a continuous time setting. It requires that the collection of martingale measures is rich enough and that the payoff function satisfies some…

Predictive uncertainty estimation is essential for deploying Deep Neural Networks in real-world autonomous systems. However, most successful approaches are computationally intensive. In this work, we attempt to address these challenges in…

We present a determinantal point process (DPP) inspired alternative to non-maximum suppression (NMS) which has become an integral step in all state-of-the-art object detection frameworks. DPPs have been shown to encourage diversity in…

Dynamic Pushdown Networks (DPNs) are a model for multithreaded programs with recursion and dynamic creation of threads. In this paper, we propose a temporal logic called NTL for reasoning about the call- and return- as well as thread…

Automated scientific discovery using large language models relies on identifying genuinely novel solutions. Standard reinforcement learning penalizes high-variance mutations, which leads the policy to prioritize familiar patterns. As a…

We study learned memory tokens as a computational scratchpad for a single-block Universal Transformer with Adaptive Computation Time (ACT) on Sudoku-Extreme, a combinatorial reasoning benchmark. Memory tokens are empirically necessary: no…

Generalised Probabilistic Theories (GPTs) provide a unifying framework encompassing classical theories, quantum theories, as well as hypothetical alternatives. We investigate the problem of extending a system with a finite set of…

It is well-known that one-tape Turing machines working in linear time are no more powerful than finite automata, namely they recognize exactly the class of regular languages. We prove that it is not decidable if a one-tape machine works in…

We elucidate a close connection between the Theory of Judgment Aggregation (more generally, Evaluation Aggregation), and a relatively young but rapidly growing field of universal algebra, that was primarily developed to investigate…

Bounded self-certification in Turing machines fails because self-simulation necessarily incurs a strictly positive temporal overhead. We translate this operational constraint into a domain-theoretic framework, defining an operator that…

Neural Turing Machines (NTM) contain memory component that simulates "working memory" in the brain to store and retrieve information to ease simple algorithms learning. So far, only linearly organized memory is proposed, and during…

I will discuss the recent proof that the complexity class NEXP (nondeterministic exponential time) lacks nonuniform ACC circuits of polynomial size. The proof will be described from the perspective of someone trying to discover it.

Bounding volumes are an established concept in computer graphics and vision tasks but have seen little change since their early inception. In this work, we study the use of neural networks as bounding volumes. Our key observation is that…

We present a new numerical method for solving time dependent Maxwell equations, which is also suitable for general linear hyperbolic equations. It is based on an unstructured partitioning of the spacetime domain into tent-shaped regions…

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

We investigate details of the chaotic dynamics of dual-unitary quantum circuits by evaluating all $2k$-point out-of-time-ordered correlators. For the generic class of circuits, by writing the correlators as contractions of a class of…