Listing 1 - 5 of 5 |
Sort by
|
Choose an application
Choose an application
621.63 --- Fans (Machinery) --- Blowers --- Blowing-engines --- Exhausters --- Fans, Electric --- Fans, Mechanical --- Exhaust systems --- Machinery --- Pneumatic-tube transportation --- Rotary air-movers. Fans. Air extractors --- 621.63 Rotary air-movers. Fans. Air extractors --- Climatisation
Choose an application
This book commemorates Solomon Marcus’s fifth death anniversary with a selection of articles in mathematics, theoretical computer science, and physics written by authors who work in Marcus’s research fields, some of whom have been influenced by his results and/or have collaborated with him.
Information technology industries --- Computer science --- automata theory --- formal language theory --- bio-informatics --- recursive function theory --- evolutionary processor --- network of evolutionary processors --- network topology --- theory of computation --- computational models --- intrinsic perception --- Hausdorff dimension --- fractal --- computational complexity --- Turing machine --- oracle Turing machine --- shortest computations --- quasiperiod --- formal language --- asymptotic growth --- polynomial --- membrane computing --- computational complexity theory --- P vs. NP problem --- evolutional communication --- symport/antiport --- Kolmogorov complexity --- random strings --- extractors --- finite languages --- deterministic finite cover automata --- multiple entry automata --- automata with “do not care” symbols --- similarity relations --- process calculus --- communication patterns --- control structures --- hypergraph model --- P systems --- cP systems --- NP-complete --- NP-hard --- SAT --- logarithmic time complexity
Choose an application
This book commemorates Solomon Marcus’s fifth death anniversary with a selection of articles in mathematics, theoretical computer science, and physics written by authors who work in Marcus’s research fields, some of whom have been influenced by his results and/or have collaborated with him.
automata theory --- formal language theory --- bio-informatics --- recursive function theory --- evolutionary processor --- network of evolutionary processors --- network topology --- theory of computation --- computational models --- intrinsic perception --- Hausdorff dimension --- fractal --- computational complexity --- Turing machine --- oracle Turing machine --- shortest computations --- quasiperiod --- formal language --- asymptotic growth --- polynomial --- membrane computing --- computational complexity theory --- P vs. NP problem --- evolutional communication --- symport/antiport --- Kolmogorov complexity --- random strings --- extractors --- finite languages --- deterministic finite cover automata --- multiple entry automata --- automata with “do not care” symbols --- similarity relations --- process calculus --- communication patterns --- control structures --- hypergraph model --- P systems --- cP systems --- NP-complete --- NP-hard --- SAT --- logarithmic time complexity
Choose an application
This book commemorates Solomon Marcus’s fifth death anniversary with a selection of articles in mathematics, theoretical computer science, and physics written by authors who work in Marcus’s research fields, some of whom have been influenced by his results and/or have collaborated with him.
Information technology industries --- Computer science --- automata theory --- formal language theory --- bio-informatics --- recursive function theory --- evolutionary processor --- network of evolutionary processors --- network topology --- theory of computation --- computational models --- intrinsic perception --- Hausdorff dimension --- fractal --- computational complexity --- Turing machine --- oracle Turing machine --- shortest computations --- quasiperiod --- formal language --- asymptotic growth --- polynomial --- membrane computing --- computational complexity theory --- P vs. NP problem --- evolutional communication --- symport/antiport --- Kolmogorov complexity --- random strings --- extractors --- finite languages --- deterministic finite cover automata --- multiple entry automata --- automata with “do not care” symbols --- similarity relations --- process calculus --- communication patterns --- control structures --- hypergraph model --- P systems --- cP systems --- NP-complete --- NP-hard --- SAT --- logarithmic time complexity --- automata theory --- formal language theory --- bio-informatics --- recursive function theory --- evolutionary processor --- network of evolutionary processors --- network topology --- theory of computation --- computational models --- intrinsic perception --- Hausdorff dimension --- fractal --- computational complexity --- Turing machine --- oracle Turing machine --- shortest computations --- quasiperiod --- formal language --- asymptotic growth --- polynomial --- membrane computing --- computational complexity theory --- P vs. NP problem --- evolutional communication --- symport/antiport --- Kolmogorov complexity --- random strings --- extractors --- finite languages --- deterministic finite cover automata --- multiple entry automata --- automata with “do not care” symbols --- similarity relations --- process calculus --- communication patterns --- control structures --- hypergraph model --- P systems --- cP systems --- NP-complete --- NP-hard --- SAT --- logarithmic time complexity
Listing 1 - 5 of 5 |
Sort by
|