Results 1  10
of
941
Asymptotic aspects of Schreier graphs and Hanoi Towers groups
 COMPTES RENDUS MATHÉMATIQUE, ACADÉMIE DES SCIENCES PARIS 342 (2006
, 2006
"... We present relations between growth, growth of diameters and the rate of vanishing of the spectral gap in Schreier graphs of automaton groups. In particular, we introduce a series of examples, called Hanoi Towers groups since they model the well known Hanoi Towers Problem, that illustrate some of th ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
We present relations between growth, growth of diameters and the rate of vanishing of the spectral gap in Schreier graphs of automaton groups. In particular, we introduce a series of examples, called Hanoi Towers groups since they model the well known Hanoi Towers Problem, that illustrate some
The unity and diversity of executive functions and their contributions to complex “Frontal Lobe” tasks: a latent variable analysis
 COGNIT PSYCHOL
, 2000
"... This individual differences study examined the separability of three often postulated executive functions—mental set shifting ("Shifting"), information updating and monitoring ("Updating"), and inhibition of prepotent responses ("Inhibition")—and their roles in complex ..."
Abstract

Cited by 696 (9 self)
 Add to MetaCart
Sorting Test (WCST), Tower of Hanoi (TOH), random number generation (RNG), operation span, and dual tasking. Confirmatory factor analysis indicated that the three target executive functions are moderately correlated with one another, but are clearly separable. Moreover, structural equation modeling
The Tower of Hanoi Problem
, 2000
"... Introduction This lecture is about the wellknown Tower of Hanoi problem. The problem is discussed in many mathematical texts, and is often used in computing science and articial intelligence as an illustration of \recursion" as a problemsolving strategy. The discussion of the problem in \The ..."
Abstract
 Add to MetaCart
Introduction This lecture is about the wellknown Tower of Hanoi problem. The problem is discussed in many mathematical texts, and is often used in computing science and articial intelligence as an illustration of \recursion" as a problemsolving strategy. The discussion of the problem
Abstracting the Tower of Hanoi
 IN WORKING NOTES OF AAAI90 WORKSHOP ON AUTOMATIC GENERATION OF APPROXIMATIONS AND ABSTRACTIONS
, 1990
"... This paper describes an automated approach to generating abstractions for the Tower of Hanoi and analyzes the use of these abstractions for problem solving. The analysis shows that the learned abstractions produce an exponential reduction in the size of the search space. Since few problem solvers ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
This paper describes an automated approach to generating abstractions for the Tower of Hanoi and analyzes the use of these abstractions for problem solving. The analysis shows that the learned abstractions produce an exponential reduction in the size of the search space. Since few problem
On the Iterative Solution of the Towers of Hanoi Problem
, 2000
"... We give an elegant proof (formal, calculational, readable, machine verifiable, without case distinctions) of the property that in the Towers of Hanoi solution all disks cycle. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We give an elegant proof (formal, calculational, readable, machine verifiable, without case distinctions) of the property that in the Towers of Hanoi solution all disks cycle.
The Associativity of Equivalence and the Towers of Hanoi Problem
, 2000
"... Dijkstra and Scholten have argued that greater use should be made of the associativity of equivalence. This note shows how the property is used in specifying the rotation of the disks in the wellknown Towers of Hanoi problem. Keywords: propositional calculus, program correctness. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Dijkstra and Scholten have argued that greater use should be made of the associativity of equivalence. This note shows how the property is used in specifying the rotation of the disks in the wellknown Towers of Hanoi problem. Keywords: propositional calculus, program correctness.
On the Iterative Solution of the Towers of Hanoi Problem
"... We give an elegant proof (formal, calculational, readable, machine verifiable, without case distinctions) of the property that in the Towers of Hanoi solution all disks cycle. ..."
Abstract
 Add to MetaCart
We give an elegant proof (formal, calculational, readable, machine verifiable, without case distinctions) of the property that in the Towers of Hanoi solution all disks cycle.
The Tower of Hanoi with Forbidden Moves
"... The Tower of Hanoi problem, composed over a hundred years ago by Lucas [1], is stated as follows: Given are 3 pegs and a certain number n of disks of distinct sizes. Initially all disks are stacked (the tower) on the first peg (the source) ordered by size, with the smallest at the top and the larges ..."
Abstract
 Add to MetaCart
The Tower of Hanoi problem, composed over a hundred years ago by Lucas [1], is stated as follows: Given are 3 pegs and a certain number n of disks of distinct sizes. Initially all disks are stacked (the tower) on the first peg (the source) ordered by size, with the smallest at the top
Results 1  10
of
941