Results 241 to 250 of about 23,253 (274)
Some of the next articles are maybe not open access.
Cognitive Processing, 2014
Abstract The experimental probing of recursion in human performance is fraught with non-trivial problems. Here, a number of case studies from the literature are analysed that contrast with the approach set out in chapter 5, and it is proposed that they give little information about the underlying mental processes at play within each of ...
openaire +2 more sources
Abstract The experimental probing of recursion in human performance is fraught with non-trivial problems. Here, a number of case studies from the literature are analysed that contrast with the approach set out in chapter 5, and it is proposed that they give little information about the underlying mental processes at play within each of ...
openaire +2 more sources
, 2023 2005
In this talk we will discuss recent work on the modeling and algorithmic analysis of systems involving recursion and probability. There has been intense activity recently in the study of such systems [2,3,10,11,13,14,15,16,17]. The primary motivation comes from the analysis of probabilistic programs with procedures.
Kousha Etessami, Mihalis Yannakakis
openaire +1 more source
In this talk we will discuss recent work on the modeling and algorithmic analysis of systems involving recursion and probability. There has been intense activity recently in the study of such systems [2,3,10,11,13,14,15,16,17]. The primary motivation comes from the analysis of probabilistic programs with procedures.
Kousha Etessami, Mihalis Yannakakis
openaire +1 more source
Recursive and nonrecursive programs
1997For 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
1986
Problems of the effective synthesis of fastest programs (modulo a recursive factor) for recursive functions given by input-output examples or an arbitrary program are investigated. In spite of the negative result proved by AL/TON we point out that even for function classes containing arbitrarily complex functions sometimes the effective synthesis of ...
openaire +1 more source
Problems of the effective synthesis of fastest programs (modulo a recursive factor) for recursive functions given by input-output examples or an arbitrary program are investigated. In spite of the negative result proved by AL/TON we point out that even for function classes containing arbitrarily complex functions sometimes the effective synthesis of ...
openaire +1 more source
1995
The main purpose of this chapter is to introduce recursion. Recursion is a simple yet powerful idea that can be enormously useful in developing algorithms for solving complex problems. This is especially true if an algorithm is to be implemented in Lisp or a related programming language such as Scheme.
openaire +1 more source
The main purpose of this chapter is to introduce recursion. Recursion is a simple yet powerful idea that can be enormously useful in developing algorithms for solving complex problems. This is especially true if an algorithm is to be implemented in Lisp or a related programming language such as Scheme.
openaire +1 more source
Recursivity, sequence recursivity, stack recursivity and semantics of programs
1976Giorgio Germano +1 more
openaire +1 more source
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
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
Recursive and Recursively Enumerable Sets
1987In 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