Search results for "Recursion"
showing 10 items of 61 documents
A reduction theorem for the Galois–McKay conjecture
2020
We introduce H {\mathcal {H}} -triples and a partial order relation on them, generalizing the theory of ordering character triples developed by Navarro and Späth. This generalization takes into account the action of Galois automorphisms on characters and, together with previous results of Ladisch and Turull, allows us to reduce the Galois–McKay conjecture to a question about simple groups.
Strategien bei Problemen mit rekursiver Lösung
1989
Recursion is not only a means for describing mathematical concepts, it is also an important problem solving tool in both mathematics and computer sciences. Recursion is the object of interest in our research project. In this article, we are going to report on an investigation aiming at the identification of strategies 7th and 8th graders use while coping with the recursive TOWER OFHANOI problem. Our hypothesis is that there are preliminary concepts for the concept of recursion which may vary for different students. We will describe some preliminary concepts in this paper.
Sequential formula translation
1983
The syntax of an algorithmic language such as ALGOL is conveniently described as a sequence of states indicated by an element called cellar. Transitions are controlled by admissible state- s ymbol pairs which may be represented by a transition matrix. This description of syntax furnishes at the same time an extremely simple rule for translating into machine programs statements in the algorithmic language. Sequential treatment, however, is not feasible in the case of certain optimizing processes such as recursive address calculation.
Introduction
2017
The book is devoted to three key questions concerning the relationship between complexity and natural language. Briefly, such questions are: (a) What kind of complexity for natural language? (b) Which theory of language in the perspective of complexity? (c) What sorts of methods and models in the analysis of the observed phenomena? All the essays in this volume show the reference to complexity as a constant element. However, the use of the singular may not be entirely appropriate.
Verification of Well-Formed Communicating Recursive State Machines
2008
AbstractIn this paper we introduce a new (non-Turing equivalent) formal model of recursive concurrent programs called well-formed communicating recursive state machines (CRSM). CRSM extend recursive state machines (RSM) by allowing a restricted form of concurrency: a state of a module can be refined into a finite collection of modules (working in parallel) in a potentially recursive manner. Communication is only possible between the activations of modules invoked on the same fork. We study the model-checking problem of CRSM with respect to specifications expressed in a temporal logic that extends CaRet with a parallel operator (ConCaRet). We propose a decision algorithm that runs in time ex…
Le métier de linguiste.
2021
The paper aims to analyze the epistemological status of theoretical linguistics.
Taxonomic flux as a measure of evolutionary turnover
2021
We introduce a new metric, "taxonomic flux", to quantify evolutionary trends both within and across taxonomic boundaries. This metric is normalized, which reduces the effect of sample size disparity between biologic groups and time intervals. Furthermore, this methodology considers stratigraphic range data as a whole, and measures relative growth or decline of diversity values as they deviate from system stability. Such trends may yield key information relating to evolutionary processes and forcing functions, especially if these trends are correlative within particular taxa or niche occupancy. Thus far, scientists and researchers have been stymied by absolute values derived from unequal dat…
Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time
2002
This article presents two algebraic characterizations and two related complete problems for the complexity class DLIN that was introduced in [E. Grandjean, Ann. Math. Artif. Intell., 16 (1996), pp. 183--236]. DLIN is essentially the class of all functions that can be computed in linear time on a Random Access Machine which uses only numbers of linear value during its computations. The algebraic characterizations are in terms of recursion schemes that define unary functions. One of these schemes defines several functions simultaneously, while the other one defines only one function. From the algebraic characterizations, we derive two complete problems for DLIN under new, very strict, and mac…
Stationary sets of the mean curvature flow with a forcing term
2020
We consider the flat flow approach for the mean curvature equation with forcing in an Euclidean space $\mathbb R^n$ of dimension at least 2. Our main results states that tangential balls in $\mathbb R^n$ under any flat flow with a bounded forcing term will experience fattening, which generalizes the result by Fusco, Julin and Morini from the planar case to higher dimensions. Then, as in the planar case, we are able to characterize stationary sets in $\mathbb R^n$ for a constant forcing term as finite unions of equisized balls with mutually positive distance.
Is recursion language-specific? Evidence of recursive mechanisms in the structure of intentional action
2014
In their 2002 seminal paper Hauser, Chomsky and Fitch hypothesize that recursion is the only human-specific and language-specific mechanism of the faculty of language. While debate focused primarily on the meaning of recursion in the hypothesis and on the human-specific and syntax-specific character of recursion, the present work focuses on the claim that recursion is language-specific. We argue that there are recursive structures in the domain of motor intentionality by way of extending John R. Searle's analysis of intentional action. We then discuss evidence from cognitive science and neuroscience supporting the claim that motor-intentional recursion is language-independent and suggest so…