Related papers: A Survey on Continuous Time Computations
An overview is given of recent developments in the field of Dirac equations generalized to curved space-times. An illustrative discussion is provided. We conclude with a variation of Dirac's large-number hypothesis which relates a number of…
We briefly review two concepts of time - the usual time associated with "being" and more recent ideas, answering to the description of "becoming". The approximation involved in the former is examined. Finally we argue that it is…
Time series of counts arise in a variety of forecasting applications, for which traditional models are generally inappropriate. This paper introduces a hierarchical Bayesian formulation applicable to count time series that can easily…
Context: New software development patterns are emerging aiming at accelerating the process of delivering value. One is Continuous Experimentation, which allows to systematically deploy and run instrumented software variants during…
Computer experiments refer to the study of real systems using complex simulation models. They have been widely used as alternatives to physical experiments. Design and analysis of computer experiments have attracted great attention in past…
We discuss the development of novel deep learning algorithms to enable real-time regression analysis for time series data. We showcase the application of this new method with a timely case study, and then discuss the applicability of this…
The theory of computational complexity focuses on functions and, hence, studies programs whose interactive behavior is reduced to a simple question/answer pattern. We propose a broader theory whose ultimate goal is expressing and analyzing…
Uncovering the structure of socioeconomic systems and timely estimation of socioeconomic status are significant for economic development. The understanding of socioeconomic processes provides foundations to quantify global economic…
We study a random dynamical system such that one transformation is randomly selected from a family of transformations and then applied on each iteration. For such random dynamical systems, we consider estimates of absolutely continuous…
We describe various computational models based initially, but not exclusively, on that of the Turing machine, that are generalized to allow for transfinitely many computational steps. Variants of such machines are considered that have…
This paper reviews connections between physics and computation, and explores their implications. The main topics are computational "hardness" of physical systems, computational status of fundamental theories, quantum computation, and the…
Timed transition systems are behavioural models that include an explicit treatment of time flow and are used to formalise the semantics of several foundational process calculi and automata. Despite their relevance, a general mathematical…
Recently, it has been experimentally demonstrated that individual memory units coupled in certain topology can provide the intended performance. However, experimental or simulation based evaluation of different coupled memory topologies and…
Classically, a control loop is designed to be executed strictly periodically. This is, however, difficult to achieve in many scenarios, for example, when overload or packet loss cannot be entirely avoided. Here, weakly-hard real-time…
A set of algorithms is presented for efficient numerical calculation of the time evolution of classical dynamical systems. Starting with a first approximation for solving the differential equations that has a "reversible" character, we show…
We present an algorithm to evaluate the large deviation functions associated to history-dependent observables. Instead of relying on a time discretisation procedure to approximate the dynamics, we provide a direct continuous-time algorithm,…
Some ideas aimed to understand that time is one-dimensional are briefly reviewed. Some attempts to construct theories in varieties with more spatial and temporal components are presented. It is discussed, from the epistemological point of…
We develop a full-fledged analysis of an algorithmic decision process that, in a multialternative choice problem, produces computable choice probabilities and expected decision times.
We survey aspects of prediction theory in infinitely many dimensions, with a view to the theory and applications of functional time series.
The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is…