We correct typos in search queries

We correct typos in search queriesProbably, any service that generally has a search, sooner or later comes to the need to learn how to correct errors in user requests. Errare humanum est; users are constantly sealed and mistaken, and the quality of the search inevitably suffers from this - and with it the user experience. 3r3r6956.  
3r3r6956.  
Moreover, each service has its own specifics, its own lexicon, which should be able to operate on a typo fixer, which greatly complicates the use of existing solutions. For example, such requests had to learn to rule our guardian:
 
3r3r6956.  
...
+ 0 -

Dependent Types - The Future of Programming Languages

Hello!
 
 
Despite the outlandishness and some distraction of the topic under consideration today - we hope that she will be able to diversify your weekend. At the end of the post we put three links from the author, allowing you to get acquainted with dependent typing in Idris, F # and jаvascript
 
Idris
 
 
F #
 
 
Adding dependent types to jаvascript 3r33381.
3r33381.Hello!  Despite the outlandishness and some distraction of the topic under consideration today - we hope that she will be able to diversify your weekend. At the end of the post we put three links from the author, allowing you to get acquainted with dependent typing in Idris, F # and jаvascript  Idris   → F #   → Adding dependent types to jаvascript 3r33381.3r33381...
+ 0 -

A little about conical duality

 3r3306. 3r3-31. When studying theoretical courses in machine learning (mat. Economics, optimization, finance, etc.), the concept of a “dual problem” is often encountered.
 3r3306.
 3r3306. Dual tasks are often used to obtain lower (or upper) estimates for the objective functional in optimization problems. In addition, for almost any meaningful formulation of the optimization problem, the dual problem has a meaningful interpretation. That is, if you are faced with an important optimization task, then its dual approach is also most likely important.
 3r3306.
 3r3306. In this article I will talk ...
+ 0 -

Creating maps of the noise functions

+ 0 -

Fuzzy logic against PID. We cross a hedgehog and a snake. Aircraft engine and control algorithms for nuclear power plants

Fuzzy logic against PID. We cross a hedgehog and a snake. Aircraft engine and control algorithms for nuclear power plants 
3r3-31. 3r38080. Probably, everyone who studied the theory of automatic control often had doubts about how these two, three or even ten squares of transfer functions in a model represent the dynamics of a complex unit, such as a nuclear reactor or an aircraft engine. Is there no cheating here? It is possible that working with simple models will cease to work with complex models in "real" life.
3r3678.  
3r38080. In this article, we will experiment with the “real” model of an aircraft engine. Having weighed it with “real” models of equipment and control algorithms from a nuclear power plant.
3r3678...
+ 0 -

Problems of modern writing of mathematical texts

Problems of modern writing of mathematical textsIn a recent article comrade KvanTTT [leech=https://habr.com/post/426939/#comment_19262209] raised the question 3r3179. :
 
3r3182. Can you explain what you do not like in modern writing (mathematical positions and) formulas and how can it be improved? 3r3185. I tried to answer in one comment, but the size of the text field did not allow me to finish the calculations. This article is 3r33258. excessively [/s] detailed response.
 
 
I must say, the material is holivarny. Mostly too emotional. Very controversial. Too personal - often based on their own experience, not rich, albeit diverse. Fasting applies to school and university 3-333258. texts ...
+ 0 -

Laplace Blur

Laplace Blur
 
 
Is it possible to blur Laplace instead of Gauss, how many times it is faster, and is it worth the loss of 1/32 accuracy.
 
3r311. 3r33232.
 
 
(Laplace Blur - The proposed original name of the algorithm)
 
 
Today, my internal demoscenary kicked me and forced me to write an article that had to be written six months ago. As an amateur at my leisure to develop original effect algorithms, I would like to propose to the public an “almost Gaussian blura” algorithm, featuring the use of extremely fast processor instructions (shifts and masks), and therefore is available for implementation up to microcontrollers ...
+ 0 -

Seymour Papert: Delightful discovery of “nothing”

 3r3186. 3r3-31.
Seymour Papert: Delightful discovery of “nothing” 3r3182. 3r3172.  3r3186. 3r3172.  3r3186. This story is excerpted from the book United Family: Bridging the Gap with the Digital Generation (Longstreet Press, 1996). 3r3172.  3r3186. 3r3172.  3r3186. Almost all parents think that it is useful for children to engage in some kind of activity called “learn math”, and therefore they are purchased with software that “teaches children to math”. Everything seems to be in order. But what is wrong is their idea of ​​what mathematics is, and why children should study it. It is absolutely superficial: it's the same as buying food for your children...
+ 0 -

Why is Godel's incompleteness theorem difficult to prove: the point is in the wording, and not only in the essence

Why is Godel's incompleteness theorem difficult to prove: the point is in the wording, and not only in the essence 
3r3-31. Roughly speaking, Godel's incompleteness theorem states that there are true mathematical statements that cannot be proved. When I was in the 11th grade, the three of us together with the geometry teacher Mr. Olsen and my friend Uma Roy spent five weeks reading the original proof of Gödel. Why so long? Partly because we were still schoolchildren. Partly because the 24-year-old Godel was not the most talented writer. But mainly because the proof is actually quite difficult.
 
 
This may seem surprising, because all the evidence in fact can fit in one paragraph. Godel begins with constructing ...
+ 0 -

A graduate student solved the problem of confirming quantum computing

Urmila Mahadev spent eight years in the master's program in search of an answer to one of the most basic questions of quantum computing: how do we know that the quantum computer did at least something at the quantum level?


 
A graduate student solved the problem of confirming quantum computing  
 
In the spring of 201? Urmila Mahadev was in a good position, in terms of the majority of graduate students. She has just solved the most important problem of quantum computing - the field of computer studies, deriving its capabilities from the strange laws of quantum physics. Together with her earlier works, Mahadev’s new result describing the so-called “Blind computation,” ...[/h]
+ 0 -