Jiří Wiedermann

From MaRDI portal
Person:1176242

Available identifiers

zbMath Open wiedermann.jiriMaRDI QIDQ1176242

List of research outcomes





PublicationDate of PublicationType
Parallel machine models: how they are and where are they going2024-07-17Paper
Weak parallel machines: a new class of physically feasible parallel machine models2022-08-18Paper
Finite state machines with feedback: an architecture supporting minimal machine consciousness2020-05-12Paper
Question answering by humans and machines: a complexity-theoretic view2019-06-18Paper
Thirty years of collaboration with Jan van Leeuwen: in search of understanding computation2018-09-04Paper
Turing machines with one-sided advice and acceptance of the co-RE languages2018-01-05Paper
Separating the classes of recursively enumerable languages based on machine size2015-12-11Paper
A robust universal flying amorphous computer2015-09-08Paper
What is computation: an epistemic approach2015-02-20Paper
Deterministic verification of integer matrix multiplication in quadratic time2015-01-13Paper
Fast nondeterministic matrix multiplication via derandomization of Freivalds' algorithm2014-09-15Paper
A theory of interactive computation2013-06-18Paper
The many forms of amorphous computational systems2013-02-26Paper
Amorphous computing: a research agenda for the near future2012-11-15Paper
Computability and non-computability issues in amorphous computing2012-09-21Paper
On the road to thinking machines: insights and ideas2012-08-14Paper
Towards computational models of artificial cognitive systems that can, in principle, pass the Turing test2012-06-15Paper
Computation as an unbounded process2012-05-30Paper
Complexity of nondeterministic multitape computations based on crossing sequences2011-07-29Paper
Nanomachine Computing by Quorum Sensing2011-06-24Paper
A Universal Flying Amorphous Computer2011-06-17Paper
Name resolution by rewriting in dynamic networks of mobile entities2011-05-27Paper
On the universal computing power of amorphous computing systems2009-10-19Paper
WIRELESS MOBILE COMPUTING AND ITS LINKS TO DESCRIPTIVE COMPLEXITY2008-09-25Paper
How We Think of Computing Today2008-06-19Paper
On the Power of Broadcasting in Mobile Computing2008-04-29Paper
A Model of an Amorphous Computer and Its Communication Protocol2008-03-07Paper
Computability in Amorphous Structures2007-11-13Paper
Autopoietic automata: complexity issues in offspring-producing evolving processes2007-09-19Paper
https://portal.mardi4nfdi.de/entity/Q46802022006-09-22Paper
https://portal.mardi4nfdi.de/entity/Q54859692006-09-06Paper
Unconventional Computation2006-07-07Paper
https://portal.mardi4nfdi.de/entity/Q53176712005-09-19Paper
Theory Is Forever2005-01-18Paper
https://portal.mardi4nfdi.de/entity/Q48188512004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q44739752004-08-04Paper
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines2004-08-04Paper
The computational limits to the cognitive power of the neuroidal tabula rasa2004-07-22Paper
https://portal.mardi4nfdi.de/entity/Q44371082003-12-07Paper
https://portal.mardi4nfdi.de/entity/Q48034202003-04-27Paper
https://portal.mardi4nfdi.de/entity/Q45364562002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q45363462002-11-04Paper
https://portal.mardi4nfdi.de/entity/Q27621652002-08-11Paper
https://portal.mardi4nfdi.de/entity/Q45364572002-06-25Paper
https://portal.mardi4nfdi.de/entity/Q49553012000-12-11Paper
https://portal.mardi4nfdi.de/entity/Q44962582000-08-13Paper
https://portal.mardi4nfdi.de/entity/Q47636832000-07-06Paper
https://portal.mardi4nfdi.de/entity/Q42181361999-03-02Paper
Theory of neuromata1998-11-10Paper
https://portal.mardi4nfdi.de/entity/Q42790791994-09-21Paper
https://portal.mardi4nfdi.de/entity/Q40386871993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q39792611992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39751741992-06-26Paper
On the computational efficiency of symmetric neural networks1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q30319341989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38042021987-01-01Paper
Array processing machines: an abstract model1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36928701985-01-01Paper
The complexity of lexicographic sorting and searching1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41901511979-01-01Paper
On the conjecture relating minimax and minimean complexity norms1979-01-01Paper
On the lower bound for minimum comparison selection1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41257791977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41052531976-01-01Paper

Research outcomes over time

This page was built for person: Jiří Wiedermann