Примери за използване на Undecidable на Английски и техните преводи на Български
{-}
-
Colloquial
-
Official
-
Medicine
-
Ecclesiastic
-
Ecclesiastic
-
Computer
But it is also crouched and undecidable.
Subsequently, many other undecidable problems have been described.
This contradiction shows that M is undecidable.
Reprinted in The Undecidable, pp. 237ff.
Undecidable nouns: types, rules for determining their kind, examples.
Reprinted in The Undecidable, p.
In a series of papers Robinson showed that a number of mathematical theories are undecidable.
Reprinted in"The Undecidable", p. 255ff.
The importance of the halting problem lies in the fact that it is the first problem to be proved undecidable.
The halting problem is undecidable for Turing machines.
In 1953 Tarski, together with Robinson and Mostowski,published Undecidable theories.
An undecidable statement is one which can neither be proven true nor false in a formal system.
The theory of Diophantine equations has even been shown to be undecidable(see Hilbert's tenth problem).
Ray tracing in 3D optical systems with a finite set of refractive objects represented by a system of rational linear inequalities is undecidable.
The typical method of proving a problem to be undecidable is with the technique of reduction.
The halting problem is historically important because it was one of the first problems to be proved undecidable.
An impossible object(also known as an impossible figure or an undecidable figure) is a type of optical illusion.
Ray tracing in 3D optical systems with a finite set of rectangular reflective orrefractive objects is undecidable.
They proved that the Mandelbrot set is undecidable, a question which Turing theory does not allow one to even formulate.
He made a major contribution to the study of the foundations of mathematics,in particular the study of undecidable theories.
He partially answered his own question in Undecidable tiling problems in the hyperbolic plane which was published in 1978.
In Undecidable theories Tarski showed that group theory, lattices, abstract projective geometry, closure algebras and others mathematical systems are undecidable.
In 1934 Gödel gave a series of lectures at Princeton entitled On undecidable propositions of formal mathematical systems.
In Undecidable Theories, Tarski et al. showed that many mathematical systems, including lattice theory, abstract projective geometry, and closure algebras, are all undecidable.
This equivocation on the“end” of“man” points to Derrida's own view of the undecidable place of the subject within philosophical discourse.
Ray tracing in 3D optical systems with a finite set of reflective or partially reflective objects represented by a system of linear inequalities,some of which can be irrational is undecidable.
In her thesis Definability anddecision problems in arithmetic Robinson proved that the arithmetic of rational numbers is undecidable by giving an arithmetical definition of the integers in the rationals.
He also examined the concept of'essentially undecidable' introduced by Tarski, and answered an important open question by constructing a theory with a finite number of axioms that is essentially undecidable.
Work on Hilbert's 10th problem led in the late twentieth century to the construction of specific Diophantine equations for which it is undecidable whether they have a solution, or even if they do, whether they have a finite or infinite number of solutions.
In A decision method for elementary algebra and geometry Tarski showed that the first-order theory of the real numbers under addition and multiplication is decidable which is in contrast, in a way which is really surprising to non-experts, to the results of Gödel and Church who showed that the first-order theory of the natural numbers under addition andmultiplication is undecidable.