-
1 конечный разрыв
-
2 конечный скачок
finite jump мат.Русско-английский научно-технический словарь Масловского > конечный скачок
-
3 конечный разрыв
1) Engineering: finite jump2) Mathematics: external saltus, finite discontinuity, saltus (функции в точке) -
4 конечный скачок
Mathematics: finite jump -
5 разрыв
abruption, ( дефект эмалирования) drying crack, crack, (пневматика колеса, трубы, резервуара) blowout, disconnection, discontinuity, break, ( цепи) breakage, breaking, breakup, ( под действием внутреннего давления) burst, (связи, цепи) cleavage хим., clink, disruption, open, opening, fraction, fracture, ( пласта) fracturing нефт., gap, interruption, ( функции) jump, uncoupling бтх, ( отливки вследствие усадки) pulling, rip, rupture, ( полосы) shattering метал., split, tear, tearing* * *разры́в м.1. break(age); (вместимости, герметизированного пространства) puncture, rupture2. (отверстие, промежуток) break, gap3. геол. faultразры́в изображе́ния тлв. — tearing of a pictureконе́чный разры́в мат. — finite discontinuity, saltusразры́в криво́й — break [discontinuity, gap] in a curveкрива́я претерпева́ет разры́в о́коло то́чки A — the curve has a break [discontinuity] near point Aустраня́ть разры́в криво́й — remove a discontinuityразры́вы лица́ кож. — gram cracksразры́в пласта́ — seam fractureразры́в по́езда — division of a trainсквозны́е разры́вы прок. — strip breakageхру́пкий разры́в — brittle ruptureразры́в це́пи — break in a circuitамперме́тр включё́н в разры́в це́пи, напр. заземле́ния — the ammeter is connected in series with, e. g., the grounding terminalконденса́тор образу́ет ка́жущийся разры́в в це́пи постоя́нного то́ка — the capacitor is an apparent break in a d.c. circuit* * *
См. также в других словарях:
jump discontinuity — Math. a discontinuity of a function at a point where the function has finite, but unequal, limits as the independent variable approaches the point from the left and from the right. Cf. jump (def. 60). * * * … Universalium
jump discontinuity — Math. a discontinuity of a function at a point where the function has finite, but unequal, limits as the independent variable approaches the point from the left and from the right. Cf. jump (def. 60) … Useful english dictionary
Reversible jump — Markov chain Monte Carlo is an extension to standard Markov chain Monte Carlo (MCMC) methodology that allows simulation of the posterior distribution on spaces of varying dimensions. [cite journal author = Green, P.J. |authorlink=Peter Green… … Wikipedia
Classification of discontinuities — Jump point redirects here. For the science fiction concept, see jump drive. Continuous functions are of utmost importance in mathematics and applications. However, not all functions are continuous. If a function is not continuous at a point in… … Wikipedia
Register machine — In mathematical logic and theoretical computer science a register machine is a generic class of abstract machines used in a manner similar to a Turing machine. All the models are Turing equivalent. Contents 1 Overview 2 Formal definition 3 … Wikipedia
Counter machine — A counter machine is an abstract machine used in formal logic and theoretical computer science to model computation. It is the most primitive of the four types of register machines. A counter machine comprises a set of one or more unbounded… … Wikipedia
Counter machine models — This page supplements counter machine. Although some authors use the name register machine synonymously with counter machine , this article will give details and examples of only of the most primitive species the counter machine of the genus… … Wikipedia
Random access machine — In computer science, random access machine (RAM) is an abstract machine in the general class of register machines. The RAM is very similar to the counter machine but with the added capability of indirect addressing of its registers. Like the… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Algorithm examples — This article Algorithm examples supplements Algorithm and Algorithm characterizations. = An example: Algorithm specification of addition m+n =Choice of machine model:This problem has not been resolved by the mathematics community. There is no… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia