The paper studies some cases in physics such as Galilean inertia motion and etc., and presents a logical schema of recursive abduction, from which we can derive the universality of physical laws in an effective logical path without requiring infinite inductions. Recursive abduction provides an effective logical framework to connect a universal physical law with finite empirical observations based on both quasi-law tautologies and suitable recursive dimensions, two new concepts introduced in this paper. Under the viewpoint of recursive abduction, the historical difficulty from Hume’s problem naturally vanishes. In Hume’s problem one always misunderstood a time-recursive issue as an infinitely inductive problem and, thus, sank into an inescapable quagmire. With this new effective logical schema, the paper gives a concluding discussion to Hume’s problem and justifies the validity of probability argument for natural laws.

We study latching dynamics in the adaptive Potts model network, through numerical simulations with randomly and also weakly correlated patterns, and we focus on comparing its slowly and fast adapting regimes. A measure, Q, is used to quantify the quality of latching in the phase space spanned by the number of Potts states S, the number of connections per Potts unit C and the number of stored memory patterns p. We find narrow regions, or bands in phase space, where distinct pattern retrieval and duration of latching combine to yield the highest values of Q. The bands are confined by the storage capacity curve, for large p, and by the onset of finite latching, for low p. Inside the band, in the slowly adapting regime, we observe complex structured dynamics, with transitions at high crossover between correlated memory patterns; while away from the band latching transitions lose complexity in different ways: below, they are clear-cut but last so few steps as to span a transition matrix between states with few asymmetrical entries and limited entropy; while above, they tend to become random, with large entropy and bi-directional transition frequencies, but indistinguishable from noise. Extrapolating from the simulations, the band appears to scale almost quadratically in the p - S plane, and sublinearly in p - C. In the fast adapting regime the band scales similarly, and it can be made even wider and more robust, but transitions between anti-correlated patterns dominate latching dynamics. This suggest that slow and fast adaptation have to be integrated in a scenario for viable latching in a cortical system. The results for the slowly adapting regime, obtained with randomly correlated patterns, remain valid also for the case with correlated patterns, with just a simple shift in phase space.

Using an algebraic method for solving the wave equation in quantum mechanics, we encountered a new class of orthogonal polynomials on the real line. One of these is a four-parameter polynomial with a discrete spectrum. Another that appeared while solving a Heun-type equation has a mix of continuous and discrete spectra. Based on these results and on our recent study of the solution space of an ordinary differential equation of the second kind with four singular points, we introduce a modification of the hypergeometric polynomials in the Askey scheme. Up to now, all of these polynomials are defined only by their three-term recursion relations and initial values. However, their other properties like the weight function, generating function, orthogonality, Rodrigues-type formula, etc. are yet to be derived analytically. This is an open problem in orthogonal polynomials.

Gauss quadrature integral approximation is extended to include integrals with a measure consisting of a continuous as well as a discrete component. That is, we give an approximation for the integral of a function plus its sum over a discrete weighted set.