Related papers: A reply to "Problems with modelling closed timelik…
Understanding the relationship between the time-symmetric nature of physical laws and the apparent directionality of causality is a central question in quantum foundations. The standard operational formulation, widely used in quantum…
We study frequency linear-time temporal logic (fLTL) which extends the linear-time temporal logic (LTL) with a path operator $G^p$ expressing that on a path, certain formula holds with at least a given frequency p, thus relaxing the…
We consider the problem of a semiclassical description of quantum chaotic transport, when a tunnel barrier is present in one of the leads. Using a semiclassical approach formulated in terms of a matrix model, we obtain transport moments as…
General Relativity is contaminated with non-trivial geometries which generate closed timelike curves. These apparently violate causality, producing time-travel paradoxes. We shall briefly discuss these geometries and analyze some of their…
Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols resistant to attacks using Shor polynomial time algorithm for numerical field problems or Grover search algorithm. A mostly overlooked but valuable line of solutions…
The rotor-router model on a graph describes a discrete-time walk accompanied by the deterministic evolution of configurations of rotors randomly placed on vertices of the graph. We prove the following property: if at some moment of time,…
We present a cyclic symmetric space-time, admitting closed time-like curves (CTCs) which appear after a certain instant of time, i. e., a time-machine space-time. These closed time-like curves evolve from an initial spacelike hypersurface…
Trustworthy decision making in networked, dynamic environments calls for innovative uncertainty quantification substrates in predictive models for graph time series. Existing conformal prediction (CP) methods have been applied separately to…
I discuss how five reasonably sounding assumptions lead to a dilemma -- the Page-time paradox -- , which appears to challenge a conventional statistical mechanical underpinning of black hole thermodynamics. By inspecting the conceptual…
We show that in the operational setting of a two-agent, local operations, classical communication (LOCC) protocol, Alice and Bob cannot operationally distinguish monogamous entanglement from a topological identification of points in their…
We study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion ($\mathsf{ATR}_0$) from the point of view of computability-theoretic reducibilities, in particular Weihrauch…
In this work, we propose a model-agnostic instance-based post-hoc explainability method for time series classification. The proposed algorithm, namely Time-CF, leverages shapelets and TimeGAN to provide counterfactual explanations for…
The Canadian traveler problem (CTP) is the problem of traversing a given graph, where some of the edges may be blocked - a state which is revealed only upon reaching an incident vertex. Originally stated by Papadimitriou and Yannakakis…
This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories. The resulting logic,…
It is shown that, concerning the experiment described by the authors, their extension to the situation in which Alice's measurement occurs after Bob's is unnecessary and their interpretation misleading.
In this article we first observe that the Path topology of Hawking, King and MacCarthy is an analogue, in curved spacetimes, of a topology that was suggested by Zeeman as an alternative topology to his so-called Fine topology in Minkowski…
The closed causal chains arising from backward time travel do not lead to paradoxes if they are self consistent. This raises the question as to how physics ensures that only self-consistent loops are possible. We show that, for one…
Among recent developments in time series forecasting methods, deep forecasting models have gained popularity as they can utilize hidden feature patterns in time series to improve forecasting performance. Nevertheless, the majority of…
We connect the study of pseudodeterministic algorithms to two major open problems about the structural complexity of $\mathsf{BPTIME}$: proving hierarchy theorems and showing the existence of complete problems. Our main contributions can be…
We introduce the calculus of Classical Transitions (CT), which extends the research line on the relationship between linear logic and processes to labelled transitions. The key twist from previous work is registering parallelism in typing…