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.
Saved in:
| HerausgeberIn: | |
|---|---|
| Sonstige: | |
| Year of Publication: | 2022 |
| Language: | English |
| Physical Description: | 1 electronic resource (148 p.) |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
993545257304498 |
|---|---|
| ctrlnum |
(CKB)5680000000037704 (oapen)https://directory.doabooks.org/handle/20.500.12854/81158 (EXLCZ)995680000000037704 |
| collection |
bib_alma |
| record_format |
marc |
| spelling |
Calude, Cristian S. edt In Memoriam, Solomon Marcus Basel MDPI - Multidisciplinary Digital Publishing Institute 2022 1 electronic resource (148 p.) text txt rdacontent computer c rdamedia online resource cr rdacarrier 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. English Information technology industries bicssc Computer science bicssc 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 3-0365-3475-X 3-0365-3476-8 Păun, Gheorghe edt Calude, Cristian S. oth Păun, Gheorghe oth |
| language |
English |
| format |
eBook |
| author2 |
Păun, Gheorghe Calude, Cristian S. Păun, Gheorghe |
| author_facet |
Păun, Gheorghe Calude, Cristian S. Păun, Gheorghe |
| author2_variant |
c s c cs csc g p gp |
| author2_role |
HerausgeberIn Sonstige Sonstige |
| title |
In Memoriam, Solomon Marcus |
| spellingShingle |
In Memoriam, Solomon Marcus |
| title_full |
In Memoriam, Solomon Marcus |
| title_fullStr |
In Memoriam, Solomon Marcus |
| title_full_unstemmed |
In Memoriam, Solomon Marcus |
| title_auth |
In Memoriam, Solomon Marcus |
| title_new |
In Memoriam, Solomon Marcus |
| title_sort |
in memoriam, solomon marcus |
| publisher |
MDPI - Multidisciplinary Digital Publishing Institute |
| publishDate |
2022 |
| physical |
1 electronic resource (148 p.) |
| isbn |
3-0365-3475-X 3-0365-3476-8 |
| illustrated |
Not Illustrated |
| work_keys_str_mv |
AT caludecristians inmemoriamsolomonmarcus AT paungheorghe inmemoriamsolomonmarcus |
| status_str |
n |
| ids_txt_mv |
(CKB)5680000000037704 (oapen)https://directory.doabooks.org/handle/20.500.12854/81158 (EXLCZ)995680000000037704 |
| carrierType_str_mv |
cr |
| is_hierarchy_title |
In Memoriam, Solomon Marcus |
| author2_original_writing_str_mv |
noLinkedField noLinkedField noLinkedField |
| _version_ |
1796649052722429952 |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02860nam-a2200841z--4500</leader><controlfield tag="001">993545257304498</controlfield><controlfield tag="005">20231214133412.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr|mn|---annan</controlfield><controlfield tag="008">202205s2022 xx |||||o ||| 0|eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)5680000000037704</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(oapen)https://directory.doabooks.org/handle/20.500.12854/81158</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)995680000000037704</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Calude, Cristian S.</subfield><subfield code="4">edt</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">In Memoriam, Solomon Marcus</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Basel</subfield><subfield code="b">MDPI - Multidisciplinary Digital Publishing Institute</subfield><subfield code="c">2022</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 electronic resource (148 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information technology industries</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer science</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">automata theory</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">formal language theory</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">bio-informatics</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">recursive function theory</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">evolutionary processor</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">network of evolutionary processors</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">network topology</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">theory of computation</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computational models</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">intrinsic perception</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Hausdorff dimension</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">fractal</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computational complexity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Turing machine</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">oracle Turing machine</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">shortest computations</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">quasiperiod</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">formal language</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">asymptotic growth</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">polynomial</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">membrane computing</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computational complexity theory</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">P vs. NP problem</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">evolutional communication</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">symport/antiport</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Kolmogorov complexity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">random strings</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">extractors</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">finite languages</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">deterministic finite cover automata</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">multiple entry automata</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">automata with “do not care” symbols</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">similarity relations</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">process calculus</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">communication patterns</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">control structures</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">hypergraph model</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">P systems</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">cP systems</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">NP-complete</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">NP-hard</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">SAT</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">logarithmic time complexity</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-0365-3475-X</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-0365-3476-8</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Păun, Gheorghe</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Calude, Cristian S.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Păun, Gheorghe</subfield><subfield code="4">oth</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2023-12-15 05:53:05 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2022-05-14 21:41:54 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="i">DOAB Directory of Open Access Books</subfield><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&portfolio_pid=5337859750004498&Force_direct=true</subfield><subfield code="Z">5337859750004498</subfield><subfield code="b">Available</subfield><subfield code="8">5337859750004498</subfield></datafield></record></collection> |