Sentence examples for theory of algorithms from inspiring English sources

In those years, Malcev was interested in the theory of algorithms of mathematical logic and algorithmic problems of model theory.

In the 1960s he began writing articles on automata theory and theory of algorithms.

Kleene's research was devoted to the theory of algorithms and recursive functions (i.e., functions defined in a finite sequence of combinatorial steps).

Maybe you can teach students about the theory of algorithms on a blackboard, but what's the point of that when the students never get to put that knowledge to work?

Today the results of the HC research are represented both in geometry and topology and in other branches of mathematics and physics, such as Boole's algebra, operational researches, theory of algorithms and graphs, combinatorial analysis, nuclear and astrophysics, molecular dynamics, and so on.

His contributions to number theory and the theories of algorithms and computability laid the foundations of computer science.

The fact that conservation biology must rely on particularities rather than abstractions has an important consequence on the nature of theoretical work in conservation biology: theory consists of algorithms for the analysis of data on particulars, rather than more traditional universally generalized substantive claims.

We are going to analyze the convergence behavior of Algorithm 1 by using the global convergence theory of iterative algorithms developed by Zangwill [30].

In order to use the global convergence theory of iterative algorithms, we need a formal definition of iterative algorithm, as well as the definition of a set-valued mapping (a.k.a point-to-set mapping) [30]: Set-valued mapping.

Now that we know the main building blocks of the global convergence theory of iterative algorithms, we are in a position to state the convergence theorem related to Algorithm 1: Let Φ denotes the iterative Algorithm 1, and suppose that given Y ∈ R M × T, A ∈ R M × N, B 0 ∈ R N × K, C 0 ∈ R K × T, K, and λ, the sequence B t, C t t = 1 ∞ is generated and satisfies {B t+1,C t+1 }∈Φ(B t,C t ).

— Anna Russell Cal Newport is a professor of computer science at Georgetown who studies the theory of distributed algorithms.