Results 261 to 270 of about 168,604 (284)

Recursive Games

2003
Recursive games are stochastic games with the property that any nonzero-payoff is absorbing, i.e., play immediately moves to an absorbing state where each player has only one action available and these actions give this particular non-zero payoff at all further stages. By its structure, it is natural to examine such games using limiting average rewards,
openaire   +2 more sources

Recursion and Recursive Algorithms

1978
Before continuing with the treatment of search methods a full discussion of recursion is needed to prepare the ground for the next chapter on binary trees.
openaire   +1 more source

Recursive Enumerability and Recursivity

1993
Abstract Having proved that Peano Arithmetic is incomplete, we can ask another question about the system. Is there any algorithm (mechanical procedure) by which we can determine which sentences are provable in the system and which are not? This brings us to the subject of recursive function theory, to which we now turn.
openaire   +1 more source

Recursive Map Of Recursion

Abstract Recursion in human experience spans multiple domains—computational, psychological, cognitive, and phenomenological—yet these layers are frequently conflated. This taxonomy provides a precise structural breakdown of recursion across five distinct categories, defined by depth, stability, cognitive demands, and characteristic failure modes.
openaire   +1 more source

Recursive and nonrecursive programs

1997
For a universal programming language (like Pascal) recursion is, in a sense, redundant: for any recursive program it is possible to write an equivalent program without recursion. Of course, this does not mean that recursion should be avoided, because it allows us to provide elegant solutions to otherwise complicated problems.
openaire   +1 more source

Recursive Functions

1965
The concept of computable function was at first given intuitively (§ 2). We have, by virtue of an analysis of the behaviour of a calculator (§ 3), arrived at an exact definition of Turing-computability (§ 6). The direct connection with intuition, which is gained by this method, is without doubt a great advantage in realizing the meaning of the precise ...
openaire   +1 more source

Recursive and Recursively Enumerable Sets

1987
In the previous chapters we have studied computable functions f: ℕk → N and f: (W(Σ))k→W(Σ). The concept of computability is now used to define recursiveness and recursive enumerability of subsets A ⊆ ℕk and B ⊆ (W(Σ))k.
openaire   +1 more source

Recursive Dilators and Generalized Recursions

1982
Abstract We establish links between Girard's notion of recursive dilator and generalized recursions like Normann'f E-recursion and Hinman's (∞, 0)-recursion as well as with the concept of function uniformly ∞-definable over all admissible sets.
openaire   +1 more source

Recursive Equivalence

Bulletin of the London Mathematical Society, 1970
openaire   +1 more source

“Persian” Recursion

Mathematics Magazine, 1997
openaire   +1 more source