Relative Predicativity and dependent recursion in second-order set theory and higher-orders theories

This article reports that some robustness of the notions of predicativity and of autonomous progression is broken down if as the given infinite total entity we choose some mathematical entities other than the traditional ω. Namely, the equivalence between normal transfinite recursion scheme and new dependent transfinite recursion scheme, which does hold in the context of subsystems of second order number theory, does not hold in the context of subsystems of second order set theory where the universe V of sets is treated as the given totality (nor in the contexts of those of n+3-th order number or set theories, where the class of all n+2-th order objects is treated as the given totality).

Recurse : a Plato lesson on recursion /

Bibliography: p. 62.

Random recursion

Thesis (Ph.D.)--University of Washington, 2016-06

Full S matrix calculation via a single real-symmetric Lanczos recursion: The Lanczos artificial boundary inhomogeneity method

We present an efficient and robust method for the calculation of all S matrix elements (elastic, inelastic, and reactive) over an arbitrary energy range from a single real-symmetric Lanczos recursion. Our new method transforms the fundamental equations associated with Light's artificial boundary inhomogeneity approach [J. Chem. Phys. 102, 3262 (1995)] from the primary representation (original grid or basis representation of the Hamiltonian or its function) into a single tridiagonal Lanczos representation, thereby affording an iterative version of the original algorithm with greatly superior scaling properties. The method has important advantages over existing iterative quantum dynamical scattering methods: (a) the numerically intensive matrix propagation proceeds with real symmetric algebra, which is inherently more stable than its complex symmetric counterpart; (b) no complex absorbing potential or real damping operator is required, saving much of the exterior grid space which is commonly needed to support these operators and also removing the associated parameter dependence. Test calculations are presented for the collinear H+H-2 reaction, revealing excellent performance characteristics. (C) 2004 American Institute of Physics.

Evaluating functions using tail recursion and parameter substitution

This article shows a general way to implement recursive functions calculation by linear tail recursion. It emphasizes the use of tail recursion to perform computations efficiently.

Some applications of logic to feasibility in higher types

While it is commonly accepted that computability on a Turing machine in polynomial time represents a correct formalization of the notion of a feasibly computable function, there is no similar agreement on how to extend this notion on functionals, that is, what functionals should be considered feasible. One possible paradigm was introduced by Mehlhorn, who extended Cobham's definition of feasible functions to type 2 functionals. Subsequently, this class of functionals (with inessential changes of the definition) was studied by Townsend who calls this class POLY, and by Kapron and Cook who call the same class basic feasible functionals. Kapron and Cook gave an oracle Turing machine model characterisation of this class. In this article, we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalise the corresponding properties of the class of feasible functions, thus giving further evidence that the notion of feasibility of functionals mentioned above is correctly chosen. We also improve the Kapron and Cook result on machine representation.Our proofs are based on essential applications of logic. We introduce a weak fragment of second order arithmetic with second order variables ranging over functions from NN which suitably characterises basic feasible functionals, and show that it is a useful tool for investigating the properties of basic feasible functionals. In particular, we provide an example how one can extract feasible programs from mathematical proofs that use nonfeasible functions.

aa-cell in practice : an approach to musical live coding

Live coding performances provide a context with particular demands and limitations for music making. In this paper we discuss how as the live coding duo aa-cell we have responded to these challenges, and what this experience has revealed about the computational representation of music and approaches to interactive computer music performance. In particular we have identified several effective and efficient processes that underpin our practice including probability, linearity, periodicity, set theory, and recursion and describe how these are applied and combined to build sophisticated musical structures. In addition, we outline aspects of our performance practice that respond to the improvisational, collaborative and communicative requirements of musical live coding.

Variational Bayes and the reduced dependence approximation for the autologistic model on an irregular grid with applications

Discrete Markov random field models provide a natural framework for representing images or spatial datasets. They model the spatial association present while providing a convenient Markovian dependency structure and strong edge-preservation properties. However, parameter estimation for discrete Markov random field models is difficult due to the complex form of the associated normalizing constant for the likelihood function. For large lattices, the reduced dependence approximation to the normalizing constant is based on the concept of performing computationally efficient and feasible forward recursions on smaller sublattices which are then suitably combined to estimate the constant for the whole lattice. We present an efficient computational extension of the forward recursion approach for the autologistic model to lattices that have an irregularly shaped boundary and which may contain regions with no data; these lattices are typical in applications. Consequently, we also extend the reduced dependence approximation to these scenarios enabling us to implement a practical and efficient non-simulation based approach for spatial data analysis within the variational Bayesian framework. The methodology is illustrated through application to simulated data and example images. The supplemental materials include our C++ source code for computing the approximate normalizing constant and simulation studies.

The form of form : the fold and architecture

This paper will examine the idea of the fold arid its assimilation into architecture through philosophy and mathematics. In all its iterations, the fold appears as two constitutive items: the fold as self-similarity, which implies recursion; the fold within the fold, and in turn, the fold as continuous discontinuity. The persistence of this conception of die fold will be demonstrated through a discussion of Leibniz's Monadology, Deleuze's Le Pli, and some mathematical ideas from catastrophe and chaos theory. This raises the issue of continuity between disciplines and thus the philosophical status this confers on the fold.

'Explain in plain English' questions revisited : data structures problems

Recent studies have linked the ability of novice (CS1) programmers to read and explain code with their ability to write code. This study extends earlier work by asking CS2 students to explain object-oriented data structures problems that involve recursion. Results show a strong correlation between ability to explain code at an abstract level and performance on code writing and code reading test problems for these object-oriented data structures problems. The authors postulate that there is a common set of skills concerned with reasoning about programs that explains the correlation between writing code and explaining code. The authors suggest that an overly exclusive emphasis on code writing may be detrimental to learning to program. Non-code writing learning activities (e.g., reading and explaining code) are likely to improve student ability to reason about code and, by extension, improve student ability to write code. A judicious mix of code-writing and code-reading activities is recommended.

Thermodynamic scaling theory for impurities in metals

A perturbative scaling theory for calculating static thermodynamic properties of arbitrary local impurity degrees of freedom interacting with the conduction electrons of a metal is presented. The basic features are developments of the ideas of Anderson and Wilson, but the precise formulation is new and is capable of taking into account band-edge effects which cannot be neglected in certain problems. Recursion relations are derived for arbitrary interaction Hamiltonians up to third order in perturbation theory. A generalized impurity Hamiltonian is defined and its scaling equations are derived up to third order. The strategy of using such perturbative scaling equations is delineated and the renormalization-group aspects are discussed. The method is illustrated by applying it to the single-impurity Kondo problem whose static properties are well understood.

Efficient implementations of a pseudodynamical stochastic filtering strategy for static elastography

A computationally efficient pseudodynamical filtering setup is established for elasticity imaging (i.e., reconstruction of shear modulus distribution) in soft-tissue organs given statically recorded and partially measured displacement data. Unlike a regularized quasi-Newton method (QNM) that needs inversion of ill-conditioned matrices, the authors explore pseudodynamic extended and ensemble Kalman filters (PD-EKF and PD-EnKF) that use a parsimonious representation of states and bypass explicit regularization by recursion over pseudotime. Numerical experiments with QNM and the two filters suggest that the PD-EnKF is the most robust performer as it exhibits no sensitivity to process noise covariance and yields good reconstruction even with small ensemble sizes.

A new method for generation of quasi-periodic structures withn fold axes: Application to five and seven folds

A new geometrical method for generating aperiodic lattices forn-fold non-crystallographic axes is described. The method is based on the self-similarity principle. It makes use of the principles of gnomons to divide the basic triangle of a regular polygon of 2n sides to appropriate isosceles triangles and to generate a minimum set of rhombi required to fill that polygon. The method is applicable to anyn-fold noncrystallographic axis. It is first shown how these regular polygons can be obtained and how these can be used to generate aperiodic structures. In particular, the application of this method to the cases of five-fold and seven-fold axes is discussed. The present method indicates that the recursion rule used by others earlier is a restricted one and that several aperiodic lattices with five fold symmetry could be generated. It is also shown how a limited array of approximately square cells with large dimensions could be detected in a quasi lattice and these are compared with the unit cell dimensions of MnAl6 suggested by Pauling. In addition, the recursion rule for sub-dividing the three basic rhombi of seven-fold structure was obtained and the aperiodic lattice thus generated is also shown.

Resistance fluctuation at the mobility edge

Following a Migdal-Kadanoff-type bond moving procedure, we derive the renormalisation-group equations for the characteristic function of the full probability distribution of resistance (conductance) of a three-dimensional disordered system. The resulting recursion relations for the first two cumulants, K, the mean resistance and K ~ t,he meansquare deviation of resistance exhibit a mobility edge dominated by large dispersion, i.e., K $ ’/ K=, 1, suggesting inadequacy of the one-parameter scaling ansatz.

On Random Planar Curves and Their Scaling Limits

Planar curves arise naturally as interfaces between two regions of the plane. An important part of statistical physics is the study of lattice models. This thesis is about the interfaces of 2D lattice models. The scaling limit is an infinite system limit which is taken by letting the lattice mesh decrease to zero. At criticality, the scaling limit of an interface is one of the SLE curves (Schramm-Loewner evolution), introduced by Oded Schramm. This family of random curves is parametrized by a real variable, which determines the universality class of the model. The first and the second paper of this thesis study properties of SLEs. They contain two different methods to study the whole SLE curve, which is, in fact, the most interesting object from the statistical physics point of view. These methods are applied to study two symmetries of SLE: reversibility and duality. The first paper uses an algebraic method and a representation of the Virasoro algebra to find common martingales to different processes, and that way, to confirm the symmetries for polynomial expected values of natural SLE data. In the second paper, a recursion is obtained for the same kind of expected values. The recursion is based on stationarity of the law of the whole SLE curve under a SLE induced flow. The third paper deals with one of the most central questions of the field and provides a framework of estimates for describing 2D scaling limits by SLE curves. In particular, it is shown that a weak estimate on the probability of an annulus crossing implies that a random curve arising from a statistical physics model will have scaling limits and those will be well-described by Loewner evolutions with random driving forces.