Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A lower-bound search that probes two positions to retain one of three subintervals. For unresolved of positive length , put , and . If , retain ; if , retain ; otherwise retain . Sortedness preserves the lower-bound partition. The new interval lengths are , and the feasible middle case has nonnegative length at most . This proves strict progress and comparison cost. Equality must retain the first possible boundary rather than return an arbitrary matching occurrence.
Find two distinct input positions whose values sum to a target, or establish that no such pair exists. Distinct values are not required: two equal values may form a pair when they occur at different positions. On a sorted array, distinct-index two-sum by suffix lower bounds gives running time, while a two-pointer technique can give linear time.
A search algorithm whose OR nodes represent controllable choices and whose AND nodes require solutions for every possible outcome of a chosen action. In nondeterministic planning, a successful OR choice needs successful continuations for all its AND children. In contingent planning, those children can represent different observations and updated belief states. Cycle handling must match the required solution concept: ignoring a repeated state is not a proof that the goal will inevitably be reached.
Search a matrix whose rows and columns are both nondecreasing by inspecting the top-right corner of the remaining rectangle. If that value is below the target, discard its row; if above, discard its column; if equal, return its coordinates. The loop invariant retains every possible match inside the rectangle. Each failure decreases its remaining height plus width by one, proving at most inspections for positive dimensions and constant auxiliary space. Row monotonicity alone is insufficient for the column exclusion.
Iterative lengthening search repeatedly runs cost-bounded depth-first search, starting with threshold zero and replacing each unsuccessful threshold by the smallest rejected path cost. It uses a depth-first search stack rather than the potentially large search frontier of uniform-cost search.
Suppose an optimal plan has cost and each pass terminates. At every unsuccessful threshold , some first rejected prefix of an optimal plan has path cost at most . Therefore the next threshold is no larger than . Any first returned goal state has cost at most and hence exactly . Finite branching factor and a positive lower bound on step costs ensure that only finitely many search nodes precede that cost, giving completeness as well as optimality. With arbitrary real step costs, the threshold increments can be much smaller than the smallest step cost: the difference between two path costs need not itself be a step cost.
An approach to scientific explanation that subsumes a phenomenon under general laws and specified circumstances. Its deductive form is the deductive-nomological model; statistical forms permit probabilistic support rather than entailment.
Some physical relations permit deduction in both directions while supporting different explanatory roles. Pole height and solar angle can explain a shadow length even though the height can also be inferred from that length. An evidential inference need not have the same direction as the causal explanation.
“All ravens are black” is logically equivalent to “all nonblack things are nonravens”. An unrestricted rule that positive instances confirm universal generalizations would make a white shoe confirm the first statement. A Bayesian confirmation account instead conditions on background knowledge and the sampling procedure.[ref]
Evidence confirms relative to background when it increases its conditional probability. With and positive evidence probability, Bayes' theorem givesIndeed, writing , and gives the posterior probability ; comparison with reduces to . Thus scientific confirmation depends on the alternatives and background, not just on a statement's logical form.
An assumption used with a target scientific hypothesis to obtain a prediction, for example an apparatus calibration or an initial condition. Independent evidence for an auxiliary hypothesis helps distinguish a failure of the target from a failure of the test setup.
From and , infer only . A failed prediction therefore does not logically isolate failure of the target from failure of auxiliary hypotheses . Independent calibration and varied experiments can discriminate packages; the logical ambiguity does not imply that every package is equally supported.[ref]
The Aim and Structure of Physical Theory by Pierre Duhem. part II, chapter VI, section 2
Inference beyond what the premises deductively entail, often from observed cases to unobserved cases. This is distinct from mathematical induction.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





