Sinonimi & Informazioni su | Parola Inglese DECIDABLE

Esempi di utilizzo di DECIDABLE in una frase

• In computational complexity theory, the class NC (for "Nick's Class") is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors.
• The pure-group languages were the first interesting family of regular languages for which the star height problem was proved to be decidable.
• In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable, semidecidable, Turing-acceptable or Turing-recognizable) if it is a recursively enumerable subset in the set of all possible words over the alphabet of the language, i.
• BAN logic, and logics in the same family, are decidable: there exists an algorithm taking BAN hypotheses and a purported conclusion, and that answers whether or not the conclusion is derivable from the hypotheses.
• Answers a basic question about deterministic pushdown automata: it is decidable whether a given deterministic pushdown automaton accepts a regular language.
• In computability theory, a set of natural numbers is called computable, recursive, or decidable if there is an algorithm which takes a number as input, terminates after a finite amount of time (possibly depending on the given number) and correctly decides whether the number belongs to the set or not.
• Likewise, a reduction computing a noncomputable function can reduce an undecidable problem to a decidable one.
• It is predicative, all well-typed terms are strongly normalizing and Church-Rosser and the property of being well-typed is decidable.
• For example, there are undecidable theories in propositional logic, although the set of validities (the smallest theory) is decidable.
• For the decision problem, Ben-Or, Kozen, and Reif (1986) claimed to have proved that the theory of real closed fields is decidable in exponential space, and therefore in double exponential time, but their argument (in the case of more than one variable) is generally held as flawed; see Renegar (1992) for a discussion.
• Nevertheless, admissibility of rules is known to be decidable in many modal and superintuitionistic logics.
• As a consequence, the existence of common right-multiples in Artin–Tits monoids is decidable, and reduction of multifractions is effective.
• Operator-precedence languages enjoy many closure properties: union, intersection, complementation, concatenation, and they are the largest known class closed under all these operations and for which the emptiness problem is decidable.
• Examples of theories that have been shown decidable using quantifier elimination are Presburger arithmetic, algebraically closed fields, real closed fields, atomless Boolean algebras, term algebras, dense linear orders, abelian groups, random graphs, as well as many of their combinations such as Boolean algebra with Presburger arithmetic, and term algebras with queues.
• Using his axiom system, Tarski was able to show that the first-order theory of Euclidean geometry is consistent, complete and decidable: every sentence in its language is either provable or disprovable from the axioms, and we have an algorithm which decides for any given sentence whether it is provable or not.
• Other notable decidable subclasses include initialized rectangular hybrid automata, one-dimensional piecewise-constant derivatives (PCD) systems, priced timed automata, and constant-rate multi-mode systems.
• And so also in constructive set theory, while the standard order on the class of naturals is decidable, the naturals are not well-ordered.
• However, Ralph Loader demonstrated that no effectively presentable fully abstract model could exist, since the question of program equivalence in the finitary fragment of PCF is not decidable.
• The theory of (R, +, ×, 0, 1, =) was shown by Tarski to be decidable; it is the theory of real closed fields (see Decidability of first-order theories of the real numbers for more).
• This principle of bar induction is favoured in the works of Joan Moschovakis and is (intuitionistically) provably equivalent to decidable bar induction.

La preparazione della pagina ha richiesto: 422,33 ms.