Search results
Jump to navigation
Jump to search
- ...g logic, while quantitative aspects of uncertainty can be accounted for by probabilistic measures. == Probabilistic argumentation labellings == ...3 KB (407 words) - 11:07, 27 February 2024
- ...ence, and assuming that it is randomly drawn from a [[reference class]] of probabilistic speculations it is 95% certain that it will be refuted before the year 2500 ...extinction" in possibility 1 is considered fairly likely in those doomsday arguments using the number of births as a reference class, but comparing like-for-lik ...6 KB (960 words) - 21:36, 3 June 2025
- In [[mathematics]], the '''probabilistic method''' is a [[nonconstructive proof|nonconstructive]] method, primarily Another way to use the probabilistic method is by calculating the [[expected value]] of some [[random variable]] ...12 KB (1,900 words) - 01:18, 19 May 2025
- ...ns.<ref>{{Cite journal |last=Sherwood |first=H. |date=1971 |title=Complete probabilistic metric spaces |journal=Zeitschrift für Wahrscheinlichkeitstheorie und Verwa ...''S'' × ''S'', the [[ordered pair]] (''S'', ''F'') is said to be a probabilistic metric space if: ...8 KB (1,143 words) - 21:37, 27 May 2025
- ...is their tendency to multiply the [[computational complexities]] of their probabilistic and logical components. Other difficulties include the possibility of coun ...ategorized into two different classes: those logics that attempt to make a probabilistic extension to [[logical consequence|logical entailment]], such as [[Markov l ...17 KB (2,396 words) - 16:56, 23 June 2025
- ...also low for itself and the same arguments almost work for [[Bounded-error probabilistic polynomial|BPP]], but one has to account for errors, making it slightly har * Both [[Parity P]] (<math>{\oplus}\hbox{P}</math>) and [[Bounded-error probabilistic polynomial|BPP]] are low for themselves. These were important in showing [[ ...7 KB (1,111 words) - 16:59, 21 February 2023
- ...bility that none of them occurs. This lemma is most commonly used in the [[probabilistic method]], in particular to give [[nonconstructive proof|existence proofs]]. As is often the case with probabilistic arguments, this theorem is [[nonconstructive proof|nonconstructive]] and gives no met ...12 KB (1,850 words) - 06:34, 14 April 2025
- ...of [[Logic Programming Associates]] and adds support for [[fuzzy set]]s, [[Probabilistic logic|support logic]], and [[metaprogramming]]. ...(propositional) clause is a list consisting of a predicate followed by its arguments (if any). Among the types of top-level constructs are rules and direct-mode ...8 KB (1,192 words) - 20:33, 28 April 2025
- ...errational manner, not over what superrationality means, and is similar to arguments about whether it is reasonable for humans to act in a 'rational' manner, as ==Probabilistic strategies== ...13 KB (1,882 words) - 06:55, 19 December 2024
- * ''[[Probabilistic semantics]]'' originated from [[Hartry Field]] and has been shown equivalen ...6 KB (827 words) - 18:29, 15 May 2025
- ===Induction of probabilistic grammars === ...s Dyer, and Alexander M. Rush. [https://arxiv.org/pdf/1906.10225 "Compound probabilistic context-free grammars for grammar induction."] arXiv preprint arXiv:1906.10 ...18 KB (2,433 words) - 08:39, 11 May 2025
- ...er a field ''F'' is a mapping ''V'' × ''V'' → ''F'' that is linear in both arguments *[[First-order reliability method]], a semi-probabilistic reliability analysis method devised to evaluate the reliability of a system ...5 KB (716 words) - 19:04, 14 December 2024
- * The [[Dutch book arguments]] show that [[Rational agent|rational agents]] must make bets which are in ...>B \setminus (A \cap B)</math> and <math>A \cap B</math>, one arrives at a probabilistic version of the inclusion-exclusion principle<ref>{{Cite web |last=Jackson | ...11 KB (1,604 words) - 22:27, 28 October 2025
- ...predict the magnitude of the cosmological constant based on probabilistic arguments. Other attempts{{which|date=May 2017}} have been made to apply similar reas These probabilistic arguments are the most controversial aspect of the landscape. Technical criticisms of ...13 KB (1,892 words) - 10:03, 29 May 2025
- ...le.com/books?id=dYdyEAAAQBAJ&dq=probabilistic+databases+book&pg=PP1 |title=Probabilistic Databases |last2=Olteanu |first2=Dan |last3=Re |first3=Christopher |last4=K ...arded with suspicion, which is why their proponents have struggled to find arguments in their favor.<ref>{{cite book |last1=Lewis |first1=David K. |title=Counte ...16 KB (2,336 words) - 17:38, 29 May 2025
- ...rty (defined below) when they are evaluated on random independent function arguments. [[Category:Probabilistic inequalities]] ...6 KB (1,025 words) - 04:47, 1 January 2024
- ...uthor2=McCallum, A. |author3=Pereira, F. |title=Conditional random fields: Probabilistic models for segmenting and labeling sequence data|book-title =Proc. 18th Int ...el|discriminative]] [[Markov random field|undirected]] [[Statistical model|probabilistic]] [[graphical model]]. ...17 KB (2,330 words) - 18:45, 20 June 2025
- ...on would hold it, offering little additional guidance. A third, so-called “probabilistic” approach suggests adopting a numerical threshold (e.g., 90% or 95% certain ...oom, 5 L. & Soc’y Rev. 319 (1971)</ref> Some scholars have proposed that a probabilistic or numerical approach—e.g., equating “reasonable doubt” to a particular pro ...10 KB (1,493 words) - 16:27, 12 June 2025
- ...''') is the [[Boolean function]] that evaluates to false when half or more arguments are false and true otherwise, i.e. the value of the function equals the val ...ormula for majority of size O(''n''<sup>5.3</sup>). This is proved using [[probabilistic method]]. Thus, this formula is non-constructive.<ref>{{Cite journal | firs ...6 KB (831 words) - 19:57, 1 October 2025
- |[[Bounded-error probabilistic polynomial|BPP]]||Solvable in polynomial time by [[randomized algorithm]]s |[[PPAD (complexity)|PPAD]]|| Polynomial Parity Arguments on Directed graphs ...8 KB (1,203 words) - 07:24, 19 June 2024