In Memoriam, Solomon Marcus
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.
Enregistré dans:
| Format: | Online |
|---|---|
| Langue: | anglais |
| Publié: |
MDPI - Multidisciplinary Digital Publishing Institute
2022
|
| Sujets: | |
| Accès en ligne: | ONIX_20220506_9783036534756_224 |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1869529639957823488 |
|---|---|
| collection | Directory of Open Access Books |
| description | 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. |
| format | Online |
| id | doab-20.500.12854ir-81158 |
| institution | Directory of Open Access Books |
| language | eng |
| publishDate | 2022 |
| publishDateRange | 2022 |
| publishDateSort | 2022 |
| publisher | MDPI - Multidisciplinary Digital Publishing Institute |
| publisherStr | MDPI - Multidisciplinary Digital Publishing Institute |
| record_format | ojs |
| spelling | doab-20.500.12854ir-811582024-03-30T12:51:30Z In Memoriam, Solomon Marcus Calude, Cristian S. Păun, Gheorghe 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 thema EDItEUR::K Economics, Finance, Business and Management::KN Industry and industrial studies::KNT Media, entertainment, information and communication industries::KNTX Information technology industries thema EDItEUR::U Computing and Information Technology::UY Computer science 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. 2022-05-06T11:32:04Z 2022-05-06T11:32:04Z 2022 book ONIX_20220506_9783036534756_224 9783036534756 9783036534763 https://directory.doabooks.org/handle/20.500.12854/81158 eng image/jpeg Attribution 4.0 International https://mdpi.com/books/pdfview/book/5189 https://mdpi.com/books/pdfview/book/5189 MDPI - Multidisciplinary Digital Publishing Institute 10.3390/books978-3-0365-3476-3 10.3390/books978-3-0365-3476-3 46cabcaa-dd94-4bfe-87b4-55023c1b36d0 9783036534756 9783036534763 148 Basel open access |
| spellingShingle | 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 thema EDItEUR::K Economics, Finance, Business and Management::KN Industry and industrial studies::KNT Media, entertainment, information and communication industries::KNTX Information technology industries thema EDItEUR::U Computing and Information Technology::UY Computer science In Memoriam, Solomon Marcus |
| title | In Memoriam, Solomon Marcus |
| title_full | In Memoriam, Solomon Marcus |
| title_fullStr | In Memoriam, Solomon Marcus |
| title_full_unstemmed | In Memoriam, Solomon Marcus |
| title_short | In Memoriam, Solomon Marcus |
| title_sort | in memoriam solomon marcus |
| topic | 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 thema EDItEUR::K Economics, Finance, Business and Management::KN Industry and industrial studies::KNT Media, entertainment, information and communication industries::KNTX Information technology industries thema EDItEUR::U Computing and Information Technology::UY Computer science |
| topic_facet | 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 thema EDItEUR::K Economics, Finance, Business and Management::KN Industry and industrial studies::KNT Media, entertainment, information and communication industries::KNTX Information technology industries thema EDItEUR::U Computing and Information Technology::UY Computer science |
| url | ONIX_20220506_9783036534756_224 |