Related Experiment Video
Updated: May 29, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
Published on: March 18, 2019
Some decision problems for bottom-up triangle acceptors
1Department of Applied Mathematics, Hiroshima University, Hiroshima, Japan; Computer Science Center, University of Maryland, College Park, MD 20742.
Abstract:
It is proved that the emptiness problem for deterministic bottom-up triangle acceptors (BTA's) over a single input symbol is recursively unsolvable. From this result, it is also shown that certain decision problems involving BTA's and BPA's (deterministic bottom-up pyramid acceptors) are unsolvable.
Related Concept Videos
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Decision Making
Automatic decision-making is fast, intuitive, and relies on gut feelings...
Statically Indeterminate Problem Solving
Optimization Problems
SN2 Reaction: Stereochemistry
If the substrate is an achiral molecule at the α-carbon, the inversion of configuration is not observed.
Frustration and Conflict: Avoidance-Avoidance, Double-Approach Avoidance
