Renormalization and Computation II: Time Cut-off and the Halting Problem

This is the second installment to the project initiated in [Ma3]. In the first Part, I argued that both philosophy and technique of the perturbative renormalization in quantum field theory could be meaningfully transplanted to the theory of computation, and sketched several contexts supporting this view. In this second part, I address some of the issues raised in [Ma3] and provide their development in three contexts: a categorification of the algorithmic computations; time cut--off and Anytime Algorithms; and finally, a Hopf algebra renormalization of the Halting Problem.Comment: 28 page

Classical computing, quantum computing, and Shor's factoring algorithm

This is an expository talk written for the Bourbaki Seminar. After a brief introduction, Section 1 discusses in the categorical language the structure of the classical deterministic computations. Basic notions of complexity icluding the P/NP problem are reviewed. Section 2 introduces the notion of quantum parallelism and explains the main issues of quantum computing. Section 3 is devoted to four quantum subroutines: initialization, quantum computing of classical Boolean functions, quantum Fourier transform, and Grover's search algorithm. The central Section 4 explains Shor's factoring algorithm. Section 5 relates Kolmogorov's complexity to the spectral properties of computable function. Appendix contributes to the prehistory of quantum computing.Comment: 27 pp., no figures, amste

Representations of measurable sets in computable measure theory

This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly countably infinite, over some alphabet {\Sigma}. As a basic computability structure we consider a computable measure on a computable $\sigma$-algebra. We introduce and compare w.r.t. reducibility several natural representations of measurable sets. They are admissible and generally form four different equivalence classes. We then compare our representations with those introduced by Y. Wu and D. Ding in 2005 and 2006 and claim that one of our representations is the most useful one for studying computability on measurable functions

Location prediction based on a sector snapshot for location-based services

In location-based services (LBSs), the service is provided based on the users' locations through location determination and mobility realization. Most of the current location prediction research is focused on generalized location models, where the geographic extent is divided into regular-shaped cells. These models are not suitable for certain LBSs where the objectives are to compute and present on-road services. Such techniques are the new Markov-based mobility prediction (NMMP) and prediction location model (PLM) that deal with inner cell structure and different levels of prediction, respectively. The NMMP and PLM techniques suffer from complex computation, accuracy rate regression, and insufficient accuracy. In this paper, a novel cell splitting algorithm is proposed. Also, a new prediction technique is introduced. The cell splitting is universal so it can be applied to all types of cells. Meanwhile, this algorithm is implemented to the Micro cell in parallel with the new prediction technique. The prediction technique, compared with two classic prediction techniques and the experimental results, show the effectiveness and robustness of the new splitting algorithm and prediction technique

A PDE-constrained optimization formulation for discrete fracture network flows

We investigate a new numerical approach for the computation of the 3D flow in a discrete fracture network that does not require a conforming discretization of partial differential equations on complex 3D systems of planar fractures. The discretization within each fracture is performed independently of the discretization of the other fractures and of their intersections. Independent meshing process within each fracture is a very important issue for practical large scale simulations making easier mesh generation. Some numerical simulations are given to show the viability of the method. The resulting approach can be naturally parallelized for dealing with systems with a huge number of fractures

Bayesian semiparametric inference for multivariate doubly-interval-censored data

Based on a data set obtained in a dental longitudinal study, conducted in Flanders (Belgium), the joint time to caries distribution of permanent first molars was modeled as a function of covariates. This involves an analysis of multivariate continuous doubly-interval-censored data since: (i) the emergence time of a tooth and the time it experiences caries were recorded yearly, and (ii) events on teeth of the same child are dependent. To model the joint distribution of the emergence times and the times to caries, we propose a dependent Bayesian semiparametric model. A major feature of the proposed approach is that survival curves can be estimated without imposing assumptions such as proportional hazards, additive hazards, proportional odds or accelerated failure time.Comment: Published in at http://dx.doi.org/10.1214/10-AOAS368 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org

Discrete analogue computing with rotor-routers

Rotor-routing is a procedure for routing tokens through a network that can implement certain kinds of computation. These computations are inherently asynchronous (the order in which tokens are routed makes no difference) and distributed (information is spread throughout the system). It is also possible to efficiently check that a computation has been carried out correctly in less time than the computation itself required, provided one has a certificate that can itself be computed by the rotor-router network. Rotor-router networks can be viewed as both discrete analogues of continuous linear systems and deterministic analogues of stochastic processes.Comment: To appear in Chaos Special Focus Issue on Intrinsic and Designed Computatio