Juraj Wiedermann

From MaRDI portal
Person:1176242

Available identifiers

zbMath Open wiedermann.jiriMaRDI QIDQ1176242

List of research outcomes

PublicationDate of PublicationType
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
https://portal.mardi4nfdi.de/entity/Q45848952018-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
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines2004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44739752004-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/Q39751741992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39792611992-06-26Paper
On the computational efficiency of symmetric neural networks1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q30319341989-01-01Paper
Array processing machines: an abstract model1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38042021987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36928701985-01-01Paper
The complexity of lexicographic sorting and searching1981-01-01Paper
On the conjecture relating minimax and minimean complexity norms1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41901511979-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


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Juraj Wiedermann