Find link

language:

Find link is a tool written by Edward Betts.

searching for Decision problem 118 found (626 total)

Bellman equation (3,992 words) [view diff] exact match in snippet view article find links to article

of a decision problem at a certain point in time in terms of the payoff from some initial choices and the "value" of the remaining decision problem that

Partially observable Markov decision process (3,305 words) [view diff] no match in snippet view article find links to article

A partially observable Markov decision process (POMDP) is a generalization of a Markov decision process (MDP). A POMDP models an agent decision process

Counting problem (complexity) (169 words) [view diff] exact match in snippet view article

c_{R}(x)\}} denotes the corresponding decision problem. Note that cR is a search problem while #R is a decision problem, however cR can be C Cook-reduced

Warren Goldfarb (369 words) [view diff] exact match in snippet view article find links to article

history of analytic philosophy and in logic, most notably the classical decision problem. He received his A.B. and philosophy Ph.D. from Harvard University

Alonzo Church (2,194 words) [view diff] exact match in snippet view article find links to article

Church–Turing thesis, proving the unsolvability of the Entscheidungsproblem ("decision problem"), the Frege–Church ontology, and the Church–Rosser theorem. Alongside

Backward induction (3,486 words) [view diff] no match in snippet view article find links to article

Backward induction is the process of determining a sequence of optimal choices by reasoning from the end point of a problem or situation back to its beginning

Ellipsoid method (3,656 words) [view diff] exact match in snippet view article find links to article

to the binary decision problem: "is there a z ≥ 0 such that Rz ≤ r?". This can be done as follows. If the answer to the decision problem is "no", then

Analytic hierarchy process (5,971 words) [view diff] exact match in snippet view article find links to article

provides a comprehensive and rational framework for structuring a decision problem, for representing and quantifying its elements, for relating those

Analytic network process (1,635 words) [view diff] exact match in snippet view article find links to article

process (AHP) used in multi-criteria decision analysis. AHP structures a decision problem into a hierarchy with a goal, decision criteria, and alternatives,

Harry R. Lewis (4,486 words) [view diff] case mismatch in snippet view article find links to article

logic. His doctoral thesis, "Herbrand Expansions and Reductions of the Decision Problem", was supervised by Burton Dreben and dealt with Herbrand's theorem

Utility maximization problem (2,259 words) [view diff] exact match in snippet view article find links to article

my money in order to maximize my utility?" It is a type of optimal decision problem. It consists of choosing how much of each available good or service

Speedup theorem (105 words) [view diff] exact match in snippet view article find links to article

that the space and time requirements of a Turing machine solving a decision problem can be reduced by a multiplicative constant factor. Blum's speedup

Recursive competitive equilibrium (234 words) [view diff] exact match in snippet view article find links to article

the equilibrium associated with dynamic programs that represent the decision problem when agents must distinguish between aggregate and individual state

Independent set (graph theory) (3,553 words) [view diff] exact match in snippet view article

included among all the maximal independent sets. In the independent set decision problem, the input is an undirected graph and a number k, and the output is

Decision quality (1,122 words) [view diff] exact match in snippet view article find links to article

quality is framing. Having the appropriate frame ensures the right decision problem is addressed. Quality in framing is achieved when the decision makers

Formula game (234 words) [view diff] exact match in snippet view article find links to article

} . FORMULA-GAME is PSPACE-complete because it is exactly the same decision problem as True quantified Boolean formula. Player E has a winning strategy

Preference ranking organization method for enrichment evaluation (2,470 words) [view diff] exact match in snippet view article find links to article

provides a comprehensive and rational framework for structuring a decision problem, identifying and quantifying its conflicts and synergies, clusters

Yuri Gurevich (843 words) [view diff] exact match in snippet view article find links to article

1982. The best-known work of his Soviet period is on the classical decision problem. In Israel, Gurevich worked with Saharon Shelah on monadic second-order

Decision-making software (937 words) [view diff] exact match in snippet view article find links to article

necessary to have a sound knowledge of the adopted methodology and of the decision problem at hand." As mentioned earlier, most DM software is based on multi-criteria

Minimum degree spanning tree (341 words) [view diff] exact match in snippet view article find links to article

That is, it is a spanning tree whose maximum degree is minimal. The decision problem is: Given a graph G and an integer k, does G have a spanning tree such

Burton Dreben (1,856 words) [view diff] exact match in snippet view article find links to article

writings. In the 1970s, Dreben and Warren Goldfarb wrote a book on the decision problem. From 1978 onwards, Dreben gave a series of lectures at Harvard which

Dodgson's method (344 words) [view diff] exact match in snippet view article find links to article

article only directly proves NP-hardness, but it is clear that the decision problem is in NP since given a candidate and a list of k swaps, you can tell

Dana Scott (1,327 words) [view diff] case mismatch in snippet view article find links to article

Rabin, a colleague from Princeton, titled Finite Automata and Their Decision Problem (Scott and Rabin 1959) which introduced the idea of nondeterministic

Learning with errors (3,418 words) [view diff] exact match in snippet view article find links to article

version can be solved easily: just feed the input samples for the decision problem to the solver for the search problem. Denote the given samples by {

Blocks world (623 words) [view diff] exact match in snippet view article find links to article

Descriptions from Examples and Copy Demo Gerald Jay Sussman's Sussman anomaly Decision problem (Gupta and Nau, 1992): Given a starting Blocks World, an ending Blocks

Algorithm (7,354 words) [view diff] exact match in snippet view article find links to article

algorithms began with attempts to solve the Entscheidungsproblem (decision problem) posed by David Hilbert. Later formalizations were framed as attempts

Algorithm (7,354 words) [view diff] exact match in snippet view article find links to article

algorithms began with attempts to solve the Entscheidungsproblem (decision problem) posed by David Hilbert. Later formalizations were framed as attempts

Herbert York (798 words) [view diff] case mismatch in snippet view article find links to article

Retrieved 2014-05-15. http://www.edge.org/conversation/nsa-the-decision-problem. The Decision Problem Obituary of Herbert Frank York - website of Physics Today

Numerical 3-dimensional matching (689 words) [view diff] exact match in snippet view article find links to article

Numerical 3-dimensional matching is an NP-complete decision problem. It is given by three multisets of integers X {\displaystyle X} , Y {\displaystyle

Randomised decision rule (2,239 words) [view diff] exact match in snippet view article find links to article

minimaxity and Bayes. This shall be illustrated in the case of a finite decision problem, i.e. a problem where the parameter space is a finite set of, say,

Gap reduction (1,183 words) [view diff] exact match in snippet view article find links to article

complexity theory, a gap reduction is a reduction to a particular type of decision problem, known as a c-gap problem. Such reductions provide information about

Decision-making paradox (837 words) [view diff] exact match in snippet view article find links to article

descriptive, yield different results, when fed with exactly the same decision problem and data.[citation needed] It has been recognized in the related literature

Francisco Dória (1,000 words) [view diff] exact match in snippet view article find links to article

within classical set theory, is incomplete in the sense of Gödel. The decision problem for chaotic dynamical systems had been formulated by mathematician

Real closed field (2,974 words) [view diff] exact match in snippet view article find links to article

quantifier elimination are intrinsically double exponential. For the decision problem, Ben-Or, Kozen, and Reif (1986) claimed to have proved that the theory

Software (3,975 words) [view diff] exact match in snippet view article find links to article

Computable Numbers, with an Application to the Entscheidungsproblem (decision problem). This eventually led to the creation of the academic fields of computer

Linear logic (2,890 words) [view diff] exact match in snippet view article find links to article

in full CLL is undecidable. When considering fragments of CLL, the decision problem has varying complexity: Multiplicative linear logic (MLL): only the

Moses Schönfinkel (941 words) [view diff] exact match in snippet view article find links to article

Schönfinkel had one other paper published, on special cases of the decision problem (Entscheidungsproblem), that was prepared by Paul Bernays. After he

Constrained conditional model (1,502 words) [view diff] exact match in snippet view article find links to article

question answering. In all these cases, it is natural to formulate the decision problem as a constrained optimization problem, with an objective function that

Two-moment decision model (1,244 words) [view diff] exact match in snippet view article find links to article

before observing the market realization p of the product's price. Its decision problem is to choose q so as to maximize the expected utility of profit: Maximize

James Renegar (1,079 words) [view diff] exact match in snippet view article find links to article

Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals". Journal of Symbolic Computation

James Renegar (1,079 words) [view diff] exact match in snippet view article find links to article

Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals". Journal of Symbolic Computation

Hydrological optimization (781 words) [view diff] exact match in snippet view article find links to article

to find the best solution. Contaminant remediation in aquifers. The decision problem is where to locate wells, and choose a pumping rate, to minimize the

Frank Ramsey (mathematician) (4,243 words) [view diff] exact match in snippet view article

the way to his true goal in the paper, solving a special case of the decision problem for first-order logic, namely the decidability of what is now called

Interval scheduling (2,546 words) [view diff] exact match in snippet view article find links to article

intervals in which it can be executed. The group interval scheduling decision problem (GISDP) is to decide whether there exists a compatible set in which

Decision theory (3,130 words) [view diff] exact match in snippet view article find links to article

testing and parameter estimation, are special cases of the general decision problem. Wald's paper renewed and synthesized many concepts of statistical

Bayes factor (2,340 words) [view diff] exact match in snippet view article find links to article

often biased. Other approaches are: to treat model comparison as a decision problem, computing the expected value or cost of each model choice; to use

Turing machine gallery (545 words) [view diff] exact match in snippet view article find links to article

"'miraculous machine' -- a mechanical process which could work on Hilbert's decision problem" (Hodges p. 98) had been suggested by G. H. Hardy, one of Turing's

Bidding box (1,962 words) [view diff] exact match in snippet view article find links to article

wait for a while with his bid, regardless whether they have a bidding decision problem or not. The Tournament Director card is held high in the hand when

Pseudo-polynomial transformation (1,044 words) [view diff] exact match in snippet view article find links to article

{\displaystyle \Pi _{1}} is a strongly NP-complete decision problem, Π 2 {\displaystyle \Pi _{2}} is a decision problem in NP, and there exists a pseudo-polynomial

Dynamic programming (9,215 words) [view diff] exact match in snippet view article find links to article

{\displaystyle 0<a<1} . Assume capital cannot be negative. Then the consumer's decision problem can be written as follows: max ∑ t = 0 T b t ln ⁡ ( c t ) {\displaystyle

Turing completeness (3,163 words) [view diff] exact match in snippet view article find links to article

Turing independently demonstrated that Hilbert's Entscheidungsproblem (decision problem) was unsolvable, thus identifying the computational core of the incompleteness

List of cognitive biases (9,953 words) [view diff] exact match in snippet view article find links to article

a bad outcome with a decision problem, the tendency to avoid the choice previously made when faced with the same decision problem again, even though the

Decision EXpert (1,210 words) [view diff] exact match in snippet view article find links to article

Hierarchy Process (AHP). The hierarchy represents a decomposition of a decision problem into simpler sub-problems, so that higher-level attributes depend on

Samuel Bowles (economist) (2,224 words) [view diff] exact match in snippet view article

cases, "[i]ncentives undermine ethical motives" as they "may frame a decision problem and thereby suggest self-interest as appropriate behavior". Simply

SSP (431 words) [view diff] exact match in snippet view article find links to article

Supply-side platform, for web advertising Subset sum problem, an NP-complete decision problem Six-state protocol, a quantum key distribution protocol Specialist

Weighted sum model (640 words) [view diff] exact match in snippet view article find links to article

apples and oranges." For a simple numerical example suppose that a decision problem of this type is defined on three alternative choices A1, A2, A3 each

Phokion G. Kolaitis (630 words) [view diff] exact match in snippet view article find links to article

ACM Transactions on Database Systems (TODS) 30 (4), 994-1055 On the decision problem for two-variable first-order logic, E Grädel, PG Kolaitis, MY Vardi

Distributed computing (5,525 words) [view diff] exact match in snippet view article find links to article

if there are more computers running in parallel (see speedup). If a decision problem can be solved in polylogarithmic time by using a polynomial number

Cyrus Derman (971 words) [view diff] exact match in snippet view article find links to article

Lieberman and S.M. Ross, "Management Science", Vol. 18(7) 1972. A renewal decision problem with G.J. Lieberman and S.M. Ross, "Management Science", 1978 On the

Mathematics (16,275 words) [view diff] exact match in snippet view article find links to article

these traditional areas of mathematical statistics, a statistical-decision problem is formulated by minimizing an objective function, like expected loss

Framing effect (psychology) (3,079 words) [view diff] exact match in snippet view article

problem is described. For example, varied descriptions of the same decision problem should not give rise to different decisions, due to the extensionality

Bayes estimator (3,819 words) [view diff] exact match in snippet view article find links to article

hand, when n is small, the prior information is still relevant to the decision problem and affects the estimate. To see the relative weight of the prior information

Applications of sensitivity analysis to business (294 words) [view diff] exact match in snippet view article find links to article

may influence a business decision, such as e.g. an investment. In a decision problem, the analyst may want to identify cost drivers as well as other quantities

Emil Leon Post (1,397 words) [view diff] case mismatch in snippet view article find links to article

Emil Leon (1943). "Formal Reductions of the General Combinatorial Decision Problem". American Journal of Mathematics. 65 (2): 197–215. doi:10.2307/2371809

Two-variable logic (384 words) [view diff] case mismatch in snippet view article find links to article

University of Montreal, 1967 E. Grädel, P.G. Kolaitis and M. Vardi, On the Decision Problem for Two-Variable First-Order Logic, The Bulletin of Symbolic Logic

Turing Award (3,519 words) [view diff] case mismatch in snippet view article find links to article

Michael O. Rabin "For their joint paper 'Finite Automata and Their Decision Problem', which introduced the idea of nondeterministic machines, a continuous

Roger Lyndon (807 words) [view diff] case mismatch in snippet view article find links to article

coauthor of the books: Notes on Logic (Van Nostrand, 1967) Word Problems: Decision Problem in Group Theory (with W. W. Boone and F.B. Cannonito, North-Holland

Theory of art (4,019 words) [view diff] exact match in snippet view article find links to article

question of whether a new artifact is art "is not factual, but rather a decision problem, where the verdict turns on whether or not we enlarge our set of conditions

Ronald Fagin (1,179 words) [view diff] exact match in snippet view article find links to article

second-order logic coincides with the complexity class NP in the sense that a decision problem can be expressed in existential second-order logic if and only if it

Rank reversals in decision-making (2,204 words) [view diff] exact match in snippet view article find links to article

the analytic hierarchy process (AHP). They first considered a simple decision problem comprised by 3 alternatives and 2 criteria. Next a copy of a non-optimal

Arithmetical set (727 words) [view diff] exact match in snippet view article find links to article

nth arithmetical predicate. In fact, such a formula would describe a decision problem for all finite Turing jumps, and hence belongs to 0(ω), which cannot

Non-commutative cryptography (1,807 words) [view diff] exact match in snippet view article find links to article

above is the difficulty of the following two problems: The conjugacy decision problem (also called the conjugacy problem): Given two elements u and v in

Verena Huber-Dyson (1,434 words) [view diff] case mismatch in snippet view article find links to article

Stanford Research Report. 3. Huber-Dyson, Verena (1964). "On the Decision Problem for Theories of Finite Models". Israel Journal of Mathematics. 2 (1):

Post's theorem (3,832 words) [view diff] exact match in snippet view article find links to article

is for a decision problem, O m {\displaystyle O_{m}} is always "Yes" or "No", which we may formalize as 0 or 1. Suppose the decision problem itself can

Epistemic motivation (3,361 words) [view diff] exact match in snippet view article find links to article

accurate understanding of the world, including the group task, or decision problem at hand, and the degree to which group members tend to systematically

Quantum complexity theory (3,628 words) [view diff] exact match in snippet view article find links to article

can be compared based on promise problems. A promise problem is a decision problem which has an input assumed to be selected from the set of all possible

List of paradoxes (7,839 words) [view diff] exact match in snippet view article find links to article

Decision-making paradox: Selecting the best decision-making method is a decision problem in itself. Ellsberg paradox: People exhibit ambiguity aversion (as

Cycle rank (1,210 words) [view diff] exact match in snippet view article find links to article

computationally hard: Gruber (2012) proves that the corresponding decision problem is NP-complete, even for sparse digraphs of maximum outdegree at most

Glossary of economics (25,011 words) [view diff] exact match in snippet view article find links to article

of a decision problem at a certain point in time in terms of the payoff from some initial choices and the "value" of the remaining decision problem that

Post canonical system (782 words) [view diff] case mismatch in snippet view article find links to article

hierarchy. Emil Post, "Formal Reductions of the General Combinatorial Decision Problem," American Journal of Mathematics 65 (2): 197-215, 1943. Marvin Minsky

Representative agent (1,111 words) [view diff] exact match in snippet view article find links to article

model, an economist could analyze a policy change by recalculating the decision problem of each agent under the new policy, then aggregating these decisions

List of undecidable problems (1,588 words) [view diff] exact match in snippet view article find links to article

Trahtenbrot, B. A. (1950). "The impossibility of an algorithm for the decision problem for finite domains". Doklady Akademii Nauk SSSR. New Series. 70: 569–572

Max Newman (2,320 words) [view diff] exact match in snippet view article find links to article

inspired Alan Turing to embark on his work on the Entscheidungsproblem (decision problem) that had been posed by Hilbert and Ackermann in 1928. Turing's solution

James Tobin (2,357 words) [view diff] exact match in snippet view article find links to article

possible. Under Tobin's assumptions we can reformulate the person's decision problem as being one of trading off risk and expected return. Risk, or more

James Tobin (2,357 words) [view diff] exact match in snippet view article find links to article

possible. Under Tobin's assumptions we can reformulate the person's decision problem as being one of trading off risk and expected return. Risk, or more

Weighted product model (1,002 words) [view diff] exact match in snippet view article find links to article

numerical data are repeated next for easier reference. This simple decision problem is based on three alternatives denoted as A1, A2, and A3 each described

Behavioral economics (11,244 words) [view diff] exact match in snippet view article find links to article

decisions, their rationality is limited by the tractability of the decision problem, their cognitive limitations and the time available. Herbert A. Simon

Presburger arithmetic (3,225 words) [view diff] exact match in snippet view article find links to article

not internally provable (but see Gentzen's consistency proof). The decision problem for Presburger arithmetic is an interesting example in computational

Rectangle packing (949 words) [view diff] exact match in snippet view article find links to article

widths, and they should be packed in a given large rectangle. The decision problem of whether such a packing exists is NP-hard. This can be proved by

Ambiguity aversion (1,832 words) [view diff] exact match in snippet view article find links to article

ambiguity in a two-person coordination game, than a single person decision problem. More generally the results suggested that perceptions of ambiguity

List of Chinese discoveries (5,342 words) [view diff] exact match in snippet view article find links to article

Math. Soc. 171: 81–92. Zbl 0015.38803. Wu, Wen-Tsun (1978). "On the decision problem and the mechanization of theorem proving in elementary geometry". Scientia

Expected utility hypothesis (5,643 words) [view diff] exact match in snippet view article find links to article

Savage's theory are: States: The specification of every aspect of the decision problem at hand or "A description of the world leaving no relevant aspect

Envy-free item allocation (3,732 words) [view diff] exact match in snippet view article find links to article

always EF. But if we want some efficiency in addition to EF, then the decision problem becomes computationally hard:: 300–310 Deciding whether an EF and

Bag (puzzle) (342 words) [view diff] exact match in snippet view article

This decision question is NP-complete. This is proven by reducing the decision problem of deciding the 3-colorability of a planar graph, which is known to

David van Dantzig (924 words) [view diff] exact match in snippet view article find links to article

prevention, Econometrica, Vol. 24 (1956), pp. 276-287. The econometric decision problem concerning the prevention of floods in Holland (in Dutch), Report for

Modal logic (8,454 words) [view diff] case mismatch in snippet view article find links to article

University Press, 1993, p. x. McKinsey, J. C. C. (1941). "A Solution of the Decision Problem for the Lewis Systems S2 and S4, with an Application to Topology".

Tutte polynomial (5,349 words) [view diff] exact match in snippet view article find links to article

of four-colorings of a planar graph is #P-complete, even though the decision problem is trivial by the four color theorem. In contrast, it is easy to see

William Boone (mathematician) (257 words) [view diff] case mismatch in snippet view article

Amsterdam. W. W. Boone, Roger Lyndon, Frank Cannonito, Word Problems: Decision Problem in Group Theory, North-Holland, 1973. bio of Boone Novikov, Pyotr S

Battleship (puzzle) (795 words) [view diff] case mismatch in snippet view article

pp. 5–6. ISBN 1-4027-4189-8. Sevenster, M. 2004, 'Battleships as Decision Problem', ICGA Journal [Electronic], Vol. 27, No. 3, pp.142-149. ISSN 1389-6911

Regular tree grammar (1,297 words) [view diff] case mismatch in snippet view article find links to article

(1968). "Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic". Mathematical Systems Theory. 2 (1): 57–81.

J. C. C. McKinsey (706 words) [view diff] exact match in snippet view article find links to article

MR 1501878. McKinsey, J. C. C. (1941). "A solution of the decision problem for the Lewis systems S2 and S4, with an application to topology."

Pseudorandom generator (1,871 words) [view diff] exact match in snippet view article find links to article

Wigderson is a pseudorandom generator assuming that there exists a decision problem that can be computed in time 2O(n) on inputs of length n but requires

Multi-surface method (243 words) [view diff] exact match in snippet view article find links to article

versus backpropagation show MSM is better able to classify data. The decision problem associated linear program for the MSM is NP-Complete. Given two finite

Multiple-criteria decision analysis (5,801 words) [view diff] exact match in snippet view article find links to article

(GADA). Analytic hierarchy process (AHP) The AHP first decomposes the decision problem into a hierarchy of subproblems. Then the decision-maker evaluates

Peter Arcidiacono (1,896 words) [view diff] exact match in snippet view article find links to article

structural parameters without having to fully solve the agent's dynamic decision problem. Both approaches result in substantial computational gains. Arcidiacono's

Configuration graph (593 words) [view diff] exact match in snippet view article find links to article

direction, it helps to verify the complexity of a computation model; the decision problem for a (deterministic) model whose configurations are of space which

Blackwell's informativeness theorem (1,463 words) [view diff] exact match in snippet view article find links to article

{\displaystyle \sigma } over σ ′ {\displaystyle \sigma '} , for any decision problem. The result was first proven by David Blackwell in 1951, and generalized

Bounded rationality in environmental decision making (528 words) [view diff] exact match in snippet view article find links to article

individuals make decisions. Limitations include the difficulty of the decision problem, the cognitive capability of the mind, and the time available to make

Robust decision-making (2,472 words) [view diff] exact match in snippet view article find links to article

help identify and evaluate robust strategies. This structuring of the decision problem is a key feature of RDM. The traditional decision analytic approach

Term algebra (2,175 words) [view diff] exact match in snippet view article find links to article

shown decidable using quantifier elimination. The complexity of the decision problem is in NONELEMENTARY because binary constructors are injective and thus

Less-is-more effect (705 words) [view diff] exact match in snippet view article find links to article

the specific problem to which a decision strategy is applied. If the decision problem has a statistical structure that matches the structure of the heuristic

Expected value of including uncertainty (1,677 words) [view diff] exact match in snippet view article find links to article

makers may often benefit from a more systematic treatment of their decision problem, such as through quantitative analysis or decision analysis. When building

Egon Börger (642 words) [view diff] case mismatch in snippet view article find links to article

Italian Translation Bollati-Borighieri 1989) Egon Börger, The Classical Decision Problem (co-authored by E.Graedel and Y.Gurevich), Springer-Verlag 1997, ISBN 3-540-57073-X

Minimax estimator (1,961 words) [view diff] exact match in snippet view article find links to article

risk when the parameter is θ 2 {\displaystyle \theta _{2}} . In this decision problem, the minimax estimator lies on a line segment connecting two deterministic

Mir Shamsuddin Adib-Soltani (218 words) [view diff] case mismatch in snippet view article find links to article

Onlooker, Hermes Publishers, Tehran, 2010. ISBN 9789643636401 Topics in Decision Problem, Amir Kabir Publishers, Tehran, 2013. ISBN 978-964-00-1495-0 Critique

Partition problem (2,470 words) [view diff] exact match in snippet view article find links to article

O(2^{n/3})} , but it is a randomized algorithm that only solves the decision problem (not the optimization problem). Sets with only one, or no partitions

Ogden's lemma (1,819 words) [view diff] exact match in snippet view article find links to article

Post correspondence problem over binary strings, we reduce it to a decision problem over a CFG. Given any two lists of binary strings ξ 1 , . . . , ξ n

Semi-Thue system (3,402 words) [view diff] exact match in snippet view article find links to article

all that proves is that there is some Turing machine for which the decision problem is undecidable. However, that there is some Turing machine with undecidable