Skip to search formSkip to main contentSkip to account menu

Decision problem

Known as: Solvable, Decision variant, Decidability problems 
In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes-or-no answer… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Highly Cited
2005
Highly Cited
2005
Many of the important concepts and results of conventional finite automata theory are developed for a generalization in which… 
Highly Cited
2001
Highly Cited
2001
  • F. V. Jensen
  • Statistics for Engineering and Information…
  • 2001
  • Corpus ID: 42979791
Probabilistic graphical models and decision graphs are powerful modeling tools for reasoning and decision making under… 
Highly Cited
1995
Highly Cited
1995
Markov decision problems (MDPs) provide the foundations for a number of problems of interest to AI researchers studying automated… 
Highly Cited
1994
Highly Cited
1994
Highly Cited
1993
Highly Cited
1993
1. Introduction: The Classical Decision Problem.- 1.1 The Original Problem.- 1.2 The Transformation of the Classical Decision… 
Highly Cited
1982
Highly Cited
1982
Reliable computer systems must handle malfunctioning components that give conflicting information to different parts of the… 
Highly Cited
1961
Highly Cited
1961
1. Motivation. Many variants of the notion of automaton have appeared in the literature. We find it convenient here to adopt the… 
Highly Cited
1959
Highly Cited
1959
Finite automata are considered in this paper as instruments for classifying finite tapes. Each one-tape automaton defines a set… 
Highly Cited
1953
Highly Cited
1953
1. Introduction. In this paper we consider classes whose elements are re-cursively enumerable sets of non-negative integers. No…