Exemplos de uso de Problem of deciding em Inglês e suas traduções para o Português
{-}
-
Official
-
Colloquial
-
Medicine
-
Financial
-
Ecclesiastic
-
Ecclesiastic
-
Computer
-
Official/political
There is the problem of deciding on a border mechanism.
According to Rice's theorem, if there is at least one computable function in a particular class C of computable functions andanother computable function not in C then the problem of deciding whether a particular program computes a function in C is undecidable.
AM contains the problem of deciding if two graphs are not isomorphic.
In mathematics andcomputer science, a word problem for a set S with respect to a system of finite encodings of its elements is the algorithmic problem of deciding whether two given representatives represent the same element of the set.
The problem of deciding the truth of a statement in Presburger arithmetic requires even more time.
This set encodes the problem of deciding a function value.
The problem of deciding whether two convex polytopes given by either the V-description or H-description are projectively or affinely isomorphic.
Phrased as a decision problem, it is the problem of deciding whether the input has a factor less than"k.
In particular, the problem of deciding if a given instance admits a satisfying assignment can be solved in polynomial time.
When you start developing with PHP,you face the problem of deciding which IDE to choose for the Windows OS.
Historians face the problem of deciding how much space to give to each people's history and of how the histories are related to each other.
Allowing the drivers to escape paying caused a societal problem of deciding how to compensate the victims of the accidents.
Although the students did not resolve the problem of deciding what to study and what direction to pursue, in their hospital activities two notions were presented emphatically and persuasively both by the professors and by the structural characteristics of the medical school and the hospital organization. These notions are“medical responsibility” and“clinical experience.”.
John Venn pointed out in 1876 that this leads to a reference class problem of deciding in what class containing the individual case to take frequencies in.
He used this to show that the problem of deciding whether any balls reach a designated sink vertex in a Digi-Comp II-like device is also CC-complete.
A famous Rice's theorem states that if F is a subset of the set of partial computable functions from N{\displaystyle\mathbb{N}} to{ 0, 1}{\displaystyle\{0,1\}}, then unless F orits complement is empty, the problem of deciding whether or not a particular Turing machine computes a function in F is undecidable.
Depending on the underlying logic, the problem of deciding the validity of a formula varies from trivial to impossible.
The 1-halting problem is the problem of deciding of any algorithm whether it defines a function with this property, i.e., whether the algorithm halts on input 1.
A natural example of a problem in co-RP currently not known to be in P is Polynomial Identity Testing, the problem of deciding whether a given multivariate arithmetic expression over the integers is the zero-polynomial.
You see there was the major problem of deciding whether this directive ought to apply when the accident had taken place in a Member State of the European Union.
A natural example of a problem in co-RP currently not known to be in P is Polynomial Identity Testing, the problem of deciding whether a given multivariate arithmetic expression over the integers is the zero-polynomial.
Unambiguous-SAT is the promise problem of deciding whether a given Boolean formula that has at most one satisfying assignment is unsatisfiable or has exactly one satisfying assignment.
In formal logic, Horn-satisfiability, or HORNSAT,is the problem of deciding whether a given set of propositional Horn clauses is satisfiable or not.
Because these polytopes' face lattices are determined by their graphs, the problem of deciding whether two three-dimensional or simple convex polytopes are combinatorially isomorphic can be formulated equivalently as a special case of the graph isomorphism problem. .
But I can tell you here and now that the Council will not accept it, andyou will then be faced with the problem of deciding in the conciliation procedure whether you are prepared to retreat at least partly from your position, or whether you intend to delay this entire programme, which is rightly regarded as being of vital importance.
If F is a subset of the set of all partial computable function from N{\displaystyle\mathbb{N}} to itself such that F and its complement are both non-empty,then the problem of deciding whether or not a given Turing machine computes a function from F is not decidable on any exponentially generic subset of I. The following theorems are from: Theorem 2 The set of formal languages which are generically computable has measure zero.
To say instead of, we must make an advance plan, we must have a five-year projection of where the Wikipedia is going to be, or whatever, you can just say, let's coordinate the group effort, and let's deal with it as we go,because we're now well-enough coordinated that we don't have to take on the problems of deciding in advance what to do.
The problem consists of deciding where the leader will place its facilities, considering it aims to minimize its greatest regret.
In deciding a problem of strategy he began by clothing the enemy with his own resolution and farsightedness.