default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJirí Wiedermann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i1]Jirí Wiedermann, Jan van Leeuwen:
Large Language Models and the Extended Church-Turing Thesis. CoRR abs/2409.06978 (2024)- 2021
- [c52]Jirí Wiedermann
, Jan van Leeuwen:
Towards Minimally Conscious Cyber-Physical Systems: A Manifesto. SOFSEM 2021: 43-55
2010 – 2019
- 2019
- [j21]Jan van Leeuwen, Jirí Wiedermann:
Question answering by humans and machines: A complexity-theoretic view. Theor. Comput. Sci. 777: 464-473 (2019) - [c51]Jirí Wiedermann, Jan van Leeuwen:
Finite State Machines with Feedback: An Architecture Supporting Minimal Machine Consciousness. CiE 2019: 286-297 - 2018
- [e7]A Min Tjoa, Ladjel Bellatreche, Stefan Biffl, Jan van Leeuwen, Jirí Wiedermann:
SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29 - February 2, 2018, Proceedings. Lecture Notes in Computer Science 10706, Springer 2018, ISBN 978-3-319-73116-2 [contents] - 2017
- [j20]Jan van Leeuwen, Jirí Wiedermann:
Turing Machines with One-sided Advice and Acceptance of the co-RE Languages. Fundam. Informaticae 153(4): 347-366 (2017) - [c50]Jirí Wiedermann, Jan van Leeuwen:
Non-classical Turing machines: extending the notion of computation. NCMA 2017: 29-40 - [c49]Jirí Wiedermann, Jan van Leeuwen:
Epistemic Computation and Artificial Intelligence. PT-AI 2017: 215-224 - 2015
- [j19]Jan van Leeuwen, Jirí Wiedermann:
Separating the Classes of Recursively Enumerable Languages Based on Machine Size. Int. J. Found. Comput. Sci. 26(6): 677-696 (2015) - [c48]Jirí Wiedermann, Jan van Leeuwen:
What is Computation: An Epistemic Approach. SOFSEM 2015: 1-13 - 2014
- [c47]Lukás Petru, Jirí Wiedermann:
A Robust Universal Flying Amorphous Computer. Computing with New Resources 2014: 421-435 - [c46]Jirí Wiedermann:
Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds' Algorithm. IFIP TCS 2014: 123-135 - [c45]Ivan Korec, Jirí Wiedermann:
Deterministic Verification of Integer Matrix Multiplication in Quadratic Time. SOFSEM 2014: 375-382 - 2013
- [c44]Jirí Wiedermann:
The creativity mechanisms in embodied agents: An explanatory model. CIHLI 2013: 41-47 - 2012
- [j18]Jirí Wiedermann:
A Computability Argument Against Superintelligence. Cogn. Comput. 4(3): 236-245 (2012) - [j17]Jirí Wiedermann:
Thirty Years of Collaboration with Jan van Leeuwen: In Search of Understanding Computation. Bull. EATCS 108: 148-160 (2012) - [j16]Jirí Wiedermann:
Amorphous computing: a research agenda for the near future. Nat. Comput. 11(1): 59-63 (2012) - [j15]Jan van Leeuwen, Jirí Wiedermann:
Computation as an unbounded process. Theor. Comput. Sci. 429: 202-212 (2012) - [c43]Jirí Wiedermann:
On the Road to Thinking Machines: Insights and Ideas. CiE 2012: 733-744 - [c42]Jirí Wiedermann:
Computability and Non-computability Issues in Amorphous Computing. IFIP TCS 2012: 1-9 - [c41]Jirí Wiedermann:
Towards Computational Models of Artificial Cognitive Systems That Can, in Principle, Pass the Turing Test. SOFSEM 2012: 44-63 - 2011
- [c40]Jirí Wiedermann:
Nanomachine Computing by Quorum Sensing. Computation, Cooperation, and Life 2011: 203-215 - [c39]Jan van Leeuwen, Jirí Wiedermann:
Name Resolution by Rewriting in Dynamic Networks of Mobile Entities. Rainbow of Computer Science 2011: 215-227 - [c38]Jirí Wiedermann:
Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences. DCFS 2011: 314-327 - [c37]Lukás Petru, Jirí Wiedermann:
A Universal Flying Amorphous Computer. UC 2011: 189-200 - 2010
- [j14]Jirí Wiedermann:
A High Level Model of a Conscious Embodied Agent. Int. J. Softw. Sci. Comput. Intell. 2(3): 62-78 (2010)
2000 – 2009
- 2009
- [j13]Jirí Wiedermann, Lukás Petru:
On the Universal Computing Power of Amorphous Computing Systems. Theory Comput. Syst. 45(4): 995-1010 (2009) - [c36]Jirí Wiedermann:
A high level model of a conscious embodied agent. IEEE ICCI 2009: 448-456 - 2008
- [j12]Jirí Wiedermann, Dana Pardubská:
Wireless Mobile Computing and its Links to Descriptive Complexity. Int. J. Found. Comput. Sci. 19(4): 887-913 (2008) - [c35]Jirí Wiedermann, Jan van Leeuwen:
How We Think of Computing Today. CiE 2008: 579-593 - [c34]Jirí Wiedermann, Lukás Petru:
Communicating Mobile Nano-Machines and Their Computational Power. NanoNet 2008: 123-130 - 2007
- [j11]Jirí Wiedermann:
Autopoietic automata: Complexity issues in offspring-producing evolving processes. Theor. Comput. Sci. 383(2-3): 260-269 (2007) - [c33]Jirí Wiedermann, Lukás Petru:
Computability in Amorphous Structures. CiE 2007: 781-790 - [c32]Jirí Wiedermann, Dana Pardubská:
Wireless Parallel Computing and its Links to Descriptive Complexity. DCFS 2007: 41-56 - [c31]Lukás Petru, Jirí Wiedermann:
A Model of an Amorphous Computer and Its Communication Protocol. SOFSEM (1) 2007: 446-455 - 2006
- [e6]Jirí Wiedermann, Gerard Tel, Jaroslav Pokorný, Mária Bieliková, Julius Stuller:
SOFSEM 2006: Theory and Practice of Computer Science, 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merín, Czech Republic, January 21-27, 2006, Proceedings. Lecture Notes in Computer Science 3831, Springer 2006, ISBN 3-540-31198-X [contents] - 2005
- [c30]Jirí Wiedermann:
Globular Universe and Autopoietic Automata: A Framework for Artificial Life. ECAL 2005: 21-30 - [c29]Jirí Wiedermann:
Computing by Self-reproduction: Autopoietic Automata. UC 2005: 224-236 - 2004
- [j10]Jirí Wiedermann:
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines. Theor. Comput. Sci. 317(1-3): 61-69 (2004) - [c28]Peter Verbaan, Jan van Leeuwen, Jirí Wiedermann:
Complexity of Evolving Interactive Systems. Theory Is Forever 2004: 268-281 - [c27]Jirí Wiedermann:
Building a Bridge between Mirror Neurons and Theory of Embodied Cognition. SOFSEM 2004: 361-372 - 2003
- [j9]Jirí Wiedermann:
Mirror Neurons, Embodied Cognitive Agents and Imitation Learning. Comput. Artif. Intell. 22(6): 545-559 (2003) - [j8]Jirí Wiedermann:
The computational limits to the cognitive power of the neuroidal tabula rasa. J. Exp. Theor. Artif. Intell. 15(3): 267-279 (2003) - 2002
- [j7]Jirí Wiedermann, Jan van Leeuwen:
The emergent computational potential of evolving artificial living systems. AI Commun. 15(4): 205-215 (2002) - [j6]Jirí Wiedermann:
Fuzzy Turing Machines Revised. Comput. Artif. Intell. 21(3): 251-263 (2002) - [c26]Jirí Wiedermann, Jan van Leeuwen:
Relativistic Computers and Non-uniform Complexity Theory. UMC 2002: 287-299 - 2001
- [c25]Jirí Wiedermann, Jan van Leeuwen:
Emergence of a Super-Turing Computational Potential in Artificial Living Systems. ECAL 2001: 55-65 - [c24]Jan van Leeuwen, Jirí Wiedermann:
Beyond the Turing Limit: Evolving Interactive Systems. SOFSEM 2001: 90-109 - 2000
- [c23]Jirí Wiedermann:
Towards a Computational Theory of Everything. IFIP TCS 2000: 614-615 - [c22]Jan van Leeuwen, Jirí Wiedermann:
On the Power of Interactive Computing. IFIP TCS 2000: 619-623 - [c21]Jan van Leeuwen, Jirí Wiedermann:
On Algorithms and Interaction. MFCS 2000: 99-113 - [e5]Václav Hlavác, Keith G. Jeffery, Jirí Wiedermann:
SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25 - December 2, 2000, Proceedings. Lecture Notes in Computer Science 1963, Springer 2000, ISBN 3-540-41348-0 [contents]
1990 – 1999
- 1999
- [j5]Jirí Wiedermann:
Simulating the Mind: A Gaunlet Thrown to Computer Science. ACM Comput. Surv. 31(3es): 16 (1999) - [c20]Jirí Wiedermann:
The Computational Limits to the Cognitive Power of the Neuroidal Tabula Rasa. ALT 1999: 63-76 - [c19]Jirí Wiedermann:
Computational Power of Neuroidal Nets. SOFSEM 1999: 479-487 - [e4]Jirí Wiedermann, Peter van Emde Boas, Mogens Nielsen:
Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings. Lecture Notes in Computer Science 1644, Springer 1999, ISBN 3-540-66224-3 [contents] - 1998
- [j4]Jirí Síma, Jirí Wiedermann:
Theory of Neuromata. J. ACM 45(1): 155-178 (1998) - [c18]Jirí Wiedermann:
Towards Algorithmic Explanation of Mind Evolution and Functioning. MFCS 1998: 152-166 - [c17]Jirí Wiedermann:
Speeding-Up Nondeterministic Single-Tape Off-Line Computations by One Alternation. MFCS 1998: 607-615 - 1997
- [c16]Jirí Wiedermann:
Towards Machines That Can Think. SOFSEM 1997: 122-141 - 1996
- [c15]Jirí Wiedermann:
Speeding-up Single-Tape Nondeterministic Computations by Single Alternation, with Separation Results. ICALP 1996: 381-392 - 1995
- [c14]Jirí Síma, Jirí Wiedermann:
Neural Language Acceptors. Developments in Language Theory 1995: 430-439 - [c13]Jirí Wiedermann:
Parallel Machine Models: How They Are and Where Are They Going. SOFSEM 1995: 1-30 - [p1]Jirí Wiedermann:
Quo Vadetis, Parallel Machine Models? Computer Science Today 1995: 101-114 - [e3]Jirí Wiedermann, Petr Hájek:
Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings. Lecture Notes in Computer Science 969, Springer 1995, ISBN 3-540-60246-1 [contents] - [e2]Miroslav Bartosek, Jan Staudek, Jirí Wiedermann:
SOFSEM '95, 22nd Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 23 - December 1, 1995, Proceedings. Lecture Notes in Computer Science 1012, Springer 1995, ISBN 3-540-60609-2 [contents] - 1992
- [c12]Juraj Wiedermann:
Optimal Algorithms for Sorting on Single-tape Turing Machines. IFIP Congress (1) 1992: 306-314 - [c11]Juraj Wiedermann:
Weak Parallel Machines: a New Class of Physically Feasible Parallel Machine Models. MFCS 1992: 95-111 - 1991
- [j3]Juraj Wiedermann:
On the Computational Efficiency of Symmetric Neural Networks. Theor. Comput. Sci. 80(2): 337-345 (1991) - [c10]Juraj Wiedermann:
Efficient simulations of nondeterministic computations and their speed-up by the ring of cooperating machines. FAIR 1991: 59-70 - 1990
- [c9]Juraj Wiedermann:
Normalizing and Accelerating RAM Computations and the Problem of Reasonable Space Measures. ICALP 1990: 125-138 - [c8]Juraj Wiedermann:
Complexity Issues in Discrete Neurocomputing. IMYCS 1990: 93-108
1980 – 1989
- 1989
- [j2]Juraj Wiedermann:
On the Power of Synchronization. J. Inf. Process. Cybern. 25(10): 499-506 (1989) - [c7]Juraj Wiedermann:
On the Computational Efficiency of Symmetric Neural Networks. MFCS 1989: 545-552 - 1987
- [j1]Jan van Leeuwen, Jirí Wiedermann:
Array Processing Machines: An Abstract Model. BIT 27(1): 25-43 (1987) - 1986
- [e1]Jozef Gruska, Branislav Rovan, Juraj Wiedermann:
Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings. Lecture Notes in Computer Science 233, Springer 1986, ISBN 3-540-16783-8 [contents] - 1985
- [c6]Jan van Leeuwen, Jirí Wiedermann:
Array processing machines. FCT 1985: 257-268 - 1983
- [c5]Juraj Wiedermann:
Deterministic and Nondeterministic Simulation of the RAM by the Turing Machine. IFIP Congress 1983: 163-168 - 1981
- [c4]Juraj Wiedermann:
Preserving Total Order in Constant Expected Time. MFCS 1981: 554-562
1970 – 1979
- 1979
- [c3]Juraj Wiedermann:
The Complexity of Lexicographic Sorting and Searching. MFCS 1979: 517-522 - 1977
- [c2]Peter Ruzicka, Juraj Wiedermann:
How Good Is the Adversary Lower Bound? MFCS 1977: 465-474 - 1976
- [c1]Peter Ruzicka, Juraj Wiedermann:
On the Lower Bound for Minimum Comparison Selection. MFCS 1976: 495-502
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-14 23:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
