Search results

  1. 1.
    0449858 - ÚI 2016 RIV SG eng J - Journal Article
    van Leeuwen, J. - Wiedermann, Jiří
    Separating the Classes of Recursively Enumerable Languages Based on Machine Size.
    International Journal of Foundations of Computer Science. Roč. 26, č. 6 (2015), s. 677-695. ISSN 0129-0541. E-ISSN 1793-6373
    R&D Projects: GA ČR GAP202/10/1333
    Grant - others:GA ČR(CZ) GA15-04960S
    Institutional support: RVO:67985807
    Keywords : recursively enumerable languages * RE hierarchy * finite languages * machine size * descriptional complexity * Turing machines with advice
    Subject RIV: IN - Informatics, Computer Science
    Impact factor: 0.467, year: 2015
    Permanent Link: http://hdl.handle.net/11104/0251272
    FileDownloadSizeCommentaryVersionAccess
    a0449858.pdf12262.7 KBPublisher’s postprintrequire
     
     
  2. 2.
    0425970 - ÚI 2014 RIV CZ cze J - Journal Article
    Wiedermann, Jiří
    Proč počítáme a co počítáme?
    [Why do we compute and what do we compute?]
    Pokroky matematiky, fyziky & astronomie. Roč. 59, č. 1 (2014), s. 33-43. ISSN 0032-2423
    R&D Projects: GA ČR GAP202/10/1333
    Institutional support: RVO:67985807
    Keywords : výpočet * znalosti * výpočetní systémy * generování znalostí
    Subject RIV: IN - Informatics, Computer Science
    http://www.youtube.com/watch?v=Llot-KUbVRU http://hdl.handle.net/10338.dmlcz/143737
    Permanent Link: http://hdl.handle.net/11104/0231752
    FileDownloadSizeCommentaryVersionAccess
    PokrokyMFA_59-2014-1_5.pdf1369.7 KBPublisher’s postprintrequire
     
     
  3. 3.
    0393985 - ÚI 2015 RIV US eng J - Journal Article
    Šíma, Jiří
    Energy Complexity of Recurrent Neural Networks.
    Neural Computation. Roč. 26, č. 5 (2014), s. 953-973. ISSN 0899-7667. E-ISSN 1530-888X
    R&D Projects: GA ČR GAP202/10/1333
    Institutional support: RVO:67985807
    Keywords : neural network * finite automaton * energy complexity * optimal size
    Subject RIV: IN - Informatics, Computer Science
    Impact factor: 2.207, year: 2014
    Permanent Link: http://hdl.handle.net/11104/0222343
    FileDownloadSizeCommentaryVersionAccess
    0393985.pdf1776.1 KBAuthor´s preprintopen-access
     
     
  4. 4.
    0393220 - ÚI 2018 RIV NL eng J - Journal Article
    Šíma, Jiří - Žák, Stanislav
    On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity.
    Fundamenta Informaticae. Roč. 152, č. 4 (2017), s. 397-409. ISSN 0169-2968. E-ISSN 1875-8681
    R&D Projects: GA ČR GBP202/12/G061; GA ČR GAP202/10/1333
    Institutional support: RVO:67985807
    Keywords : Turing machine * hierarchy * buffer complexity * diagonalization
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Impact factor: 0.725, year: 2017
    Permanent Link: http://hdl.handle.net/11104/0221961
     
     
  5. 5.
    0383138 - ÚI 2013 RIV GR eng J - Journal Article
    Wiedermann, Jiří
    Thirty Years of Collaboration with Jan van Leeuwen: In Search of Understanding Computation.
    Bulletin of the European Association for Theoretical Computer Science. -, č. 108 (2012), s. 148-160. ISSN 0252-9742
    R&D Projects: GA ČR GAP202/10/1333
    Institutional support: RVO:67985807
    Keywords : complexity * machine models * array processing machine * interactive computing * Turing machine paradigm * hypercomputing
    Subject RIV: IN - Informatics, Computer Science
    http://albcom.lsi.upc.edu/ojs/index.php/beatcs/article/viewFile/146/161
    Permanent Link: http://hdl.handle.net/11104/0213173
     
     
  6. 6.
    0375042 - ÚI 2013 RIV US eng J - Journal Article
    Wiedermann, Jiří
    A Computability Argument Against Superintelligence.
    Cognitive Computation. Roč. 4, č. 3 (2012), s. 236-245. ISSN 1866-9956. E-ISSN 1866-9964
    R&D Projects: GA ČR GAP202/10/1333
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : cognitive systems * intelligence * extended Turing machine thesis * singularity * superintelligence
    Subject RIV: IN - Informatics, Computer Science
    Impact factor: 0.867, year: 2012
    Permanent Link: http://hdl.handle.net/11104/0207809
     
     
  7. 7.
    0368246 - ÚI 2013 RIV NL eng J - Journal Article
    van Leeuwen, J. - Wiedermann, Jiří
    Computation as an Unbounded Process.
    Theoretical Computer Science. Roč. 429, 20 April (2012), s. 202-212. ISSN 0304-3975. E-ISSN 1879-2294
    R&D Projects: GA ČR GAP202/10/1333
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : arithmetical hierarchy * hypercomputation * mind change complexity * nondeterminism * relativistic computation * unbounded computation
    Subject RIV: IN - Informatics, Computer Science
    Impact factor: 0.489, year: 2012
    Permanent Link: http://hdl.handle.net/11104/0202642
     
     
  8. 8.
    0368241 - ÚI 2012 RIV NL eng J - Journal Article
    Wiedermann, Jiří
    Amorphous Computing: A Research Agenda for the Near Future.
    Natural Computing. Roč. 11, č. 1 (2012), s. 59-63. ISSN 1567-7818. E-ISSN 1572-9796
    R&D Projects: GA ČR GAP202/10/1333
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : amorphous computing * nano-machines * flying amorphous computer
    Subject RIV: IN - Informatics, Computer Science
    Impact factor: 0.683, year: 2012
    Permanent Link: http://hdl.handle.net/11104/0202638
     
     
  9. 9.
    0367350 - ÚI 2022 RIV NL eng J - Journal Article
    Šíma, Jiří - Žák, Stanislav
    A Polynomial-Time Construction of a Hitting Set for Read-once Branching Programs of Width 3.
    Fundamenta Informaticae. Roč. 184, č. 4 (2021), s. 307-354. ISSN 0169-2968. E-ISSN 1875-8681
    R&D Projects: GA ČR GBP202/12/G061; GA ČR GAP202/10/1333
    Institutional support: RVO:67985807
    Keywords : derandomization * hitting set * read-once branching programs * bounded width * almost k-wise independent set
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Impact factor: 1.166, year: 2021
    Method of publishing: Limited access
    http://dx.doi.org/10.3233/FI-2021-2101
    Permanent Link: http://hdl.handle.net/11104/0202062
     
     
  10. 10.
    0351385 - ÚI 2012 RIV SK eng J - Journal Article
    Mikuš, M. - Savický, Petr
    Remarks on Gödel's Code as a Hash Function.
    Tatra Mountains Mathematical Publications. Roč. 47, č. 3 (2010), s. 67-80. ISSN 1210-3195
    R&D Projects: GA ČR GAP202/10/1333
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : Gödel numbering function * hash function * rational reconstruction * integer relation algorithm
    Subject RIV: BA - General Mathematics
    http://www.sav.sk/journals/uploads/0317151904m-s.pdf
    Permanent Link: http://hdl.handle.net/11104/0191151
     
     

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.