We stand with Ukraine  

Jirí Wiedermann

Orcid: 0009-0006-1587-5450

According to our database1, Jirí Wiedermann authored at least 71 papers between 1976 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Towards Minimally Conscious Cyber-Physical Systems: A Manifesto.
[BibTeX]
[DOI]
Jirí Wiedermann
,
Jan van Leeuwen
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

2019
Question answering by humans and machines: A complexity-theoretic view.
[BibTeX]
[DOI]
Jan van Leeuwen
,
Jirí Wiedermann
Theor. Comput. Sci., 2019

Finite State Machines with Feedback: An Architecture Supporting Minimal Machine Consciousness.
[BibTeX]
[DOI]
Jirí Wiedermann
,
Jan van Leeuwen
Proceedings of the Computing with Foresight and Industry, 2019

2017
Turing Machines with One-sided Advice and Acceptance of the co-RE Languages.
[BibTeX]
[DOI]
Jan van Leeuwen
,
Jirí Wiedermann
Fundam. Informaticae, 2017

Epistemic Computation and Artificial Intelligence.
[BibTeX]
[DOI]
Jirí Wiedermann
,
Jan van Leeuwen
Proceedings of the Philosophy and Theory of Artificial Intelligence 2017, 2017

Non-classical Turing machines: extending the notion of computation.
[BibTeX]
Jirí Wiedermann
,
Jan van Leeuwen
Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017

2015
Separating the Classes of Recursively Enumerable Languages Based on Machine Size.
[BibTeX]
[DOI]
Jan van Leeuwen
,
Jirí Wiedermann
Int. J. Found. Comput. Sci., 2015

What is Computation: An Epistemic Approach.
[BibTeX]
[DOI]
Jirí Wiedermann
,
Jan van Leeuwen
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

2014
Deterministic Verification of Integer Matrix Multiplication in Quadratic Time.
[BibTeX]
[DOI]
Ivan Korec
,
Jirí Wiedermann
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds' Algorithm.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the Theoretical Computer Science, 2014

A Robust Universal Flying Amorphous Computer.
[BibTeX]
[DOI]
Lukás Petru
,
Jirí Wiedermann
Proceedings of the Computing with New Resources, 2014

2013
The creativity mechanisms in embodied agents: An explanatory model.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the 2013 IEEE Symposium on Computational Intelligence for Human-like Intelligence, 2013

2012
Computation as an unbounded process.
[BibTeX]
[DOI]
Jan van Leeuwen
,
Jirí Wiedermann
Theor. Comput. Sci., 2012

Amorphous computing: a research agenda for the near future.
[BibTeX]
[DOI]
Jirí Wiedermann
Nat. Comput., 2012

Thirty Years of Collaboration with Jan van Leeuwen: In Search of Understanding Computation.
[BibTeX]
[DOI]
Jirí Wiedermann
Bull. EATCS, 2012

A Computability Argument Against Superintelligence.
[BibTeX]
[DOI]
Jirí Wiedermann
Cogn. Comput., 2012

Towards Computational Models of Artificial Cognitive Systems That Can, in Principle, Pass the Turing Test.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Computability and Non-computability Issues in Amorphous Computing.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the Theoretical Computer Science, 2012

On the Road to Thinking Machines: Insights and Ideas.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the How the World Computes, 2012

2011
A Universal Flying Amorphous Computer.
[BibTeX]
[DOI]
Lukás Petru
,
Jirí Wiedermann
Proceedings of the Unconventional Computation - 10th International Conference, 2011

Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the Descriptional Complexity of Formal Systems, 2011

Nanomachine Computing by Quorum Sensing.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the Computation, 2011

Name Resolution by Rewriting in Dynamic Networks of Mobile Entities.
[BibTeX]
[DOI]
Jan van Leeuwen
,
Jirí Wiedermann
Proceedings of the Rainbow of Computer Science, 2011

2010
A High Level Model of a Conscious Embodied Agent.
[BibTeX]
[DOI]
Jirí Wiedermann
Int. J. Softw. Sci. Comput. Intell., 2010

2009
On the Universal Computing Power of Amorphous Computing Systems.
[BibTeX]
[DOI]
Jirí Wiedermann
,
Lukás Petru
Theory Comput. Syst., 2009

2008
Wireless Mobile Computing and its Links to Descriptive Complexity.
[BibTeX]
[DOI]
Jirí Wiedermann
,
Dana Pardubská
Int. J. Found. Comput. Sci., 2008

Communicating Mobile Nano-Machines and Their Computational Power.
[BibTeX]
[DOI]
Jirí Wiedermann
,
Lukás Petru
Proceedings of the Nano-Net - Third International ICST Conference, 2008

How We Think of Computing Today.
[BibTeX]
[DOI]
Jirí Wiedermann
,
Jan van Leeuwen
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Autopoietic automata: Complexity issues in offspring-producing evolving processes.
[BibTeX]
[DOI]
Jirí Wiedermann
Theor. Comput. Sci., 2007

A Model of an Amorphous Computer and Its Communication Protocol.
[BibTeX]
[DOI]
Lukás Petru
,
Jirí Wiedermann
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Wireless Parallel Computing and its Links to Descriptive Complexity.
[BibTeX]
Jirí Wiedermann
,
Dana Pardubská
Proceedings of the 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20, 2007

Computability in Amorphous Structures.
[BibTeX]
[DOI]
Jirí Wiedermann
,
Lukás Petru
Proceedings of the Computation and Logic in the Real World, 2007

2005
Computing by Self-reproduction: Autopoietic Automata.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the Unconventional Computation, 4th International Conference, 2005

Globular Universe and Autopoietic Automata: A Framework for Artificial Life.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the Advances in Artificial Life, 8th European Conference, 2005

2004
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines.
[BibTeX]
[DOI]
Jirí Wiedermann
Theor. Comput. Sci., 2004

Building a Bridge between Mirror Neurons and Theory of Embodied Cognition.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

Complexity of Evolving Interactive Systems.
[BibTeX]
[DOI]
Peter Verbaan
,
Jan van Leeuwen
,
Jirí Wiedermann
Proceedings of the Theory Is Forever, 2004

2003
The computational limits to the cognitive power of the neuroidal tabula rasa.
[BibTeX]
[DOI]
Jirí Wiedermann
J. Exp. Theor. Artif. Intell., 2003

Mirror Neurons, Embodied Cognitive Agents and Imitation Learning.
[BibTeX]
[DOI]
Jirí Wiedermann
Comput. Artif. Intell., 2003

2002
Fuzzy Turing Machines Revised.
[BibTeX]
[DOI]
Jirí Wiedermann
Comput. Artif. Intell., 2002

The emergent computational potential of evolving artificial living systems.
[BibTeX]
[DOI]
Jirí Wiedermann
,
Jan van Leeuwen
AI Commun., 2002

Relativistic Computers and Non-uniform Complexity Theory.
[BibTeX]
[DOI]
Jirí Wiedermann
,
Jan van Leeuwen
Proceedings of the Unconventional Models of Computation, Third International Conference, 2002

2001
Beyond the Turing Limit: Evolving Interactive Systems.
[BibTeX]
[DOI]
Jan van Leeuwen
,
Jirí Wiedermann
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

Emergence of a Super-Turing Computational Potential in Artificial Living Systems.
[BibTeX]
[DOI]
Jirí Wiedermann
,
Jan van Leeuwen
Proceedings of the Advances in Artificial Life, 6th European Conference, 2001

2000
On Algorithms and Interaction.
[BibTeX]
[DOI]
Jan van Leeuwen
,
Jirí Wiedermann
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Towards a Computational Theory of Everything.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the Theoretical Computer Science, 2000

On the Power of Interactive Computing.
[BibTeX]
[DOI]
Jan van Leeuwen
,
Jirí Wiedermann
Proceedings of the Theoretical Computer Science, 2000

1999
Simulating the Mind: A Gaunlet Thrown to Computer Science.
[BibTeX]
[DOI]
Jirí Wiedermann
ACM Comput. Surv., 1999

Computational Power of Neuroidal Nets.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

1998
Theory of Neuromata.
[BibTeX]
[DOI]
Jirí Síma
,
Jirí Wiedermann
J. ACM, 1998

Speeding-Up Nondeterministic Single-Tape Off-Line Computations by One Alternation.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Towards Algorithmic Explanation of Mind Evolution and Functioning.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
Towards Machines That Can Think.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

1996
Speeding-up Single-Tape Nondeterministic Computations by Single Alternation, with Separation Results.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995
Parallel Machine Models: How They Are and Where Are They Going.
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the SOFSEM '95, 22nd Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 23, 1995

Neural Language Acceptors.
[BibTeX]
Jirí Síma
,
Jirí Wiedermann
Proceedings of the Developments in Language Theory II, 1995

Quo Vadetis, Parallel Machine Models?
[BibTeX]
[DOI]
Jirí Wiedermann
Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1992
Weak Parallel Machines: a New Class of Physically Feasible Parallel Machine Models.
[BibTeX]
[DOI]
Juraj Wiedermann
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Optimal Algorithms for Sorting on Single-tape Turing Machines.
[BibTeX]
Juraj Wiedermann
Proceedings of the Algorithms, Software, Architecture, 1992

1991
On the Computational Efficiency of Symmetric Neural Networks.
[BibTeX]
[DOI]
Juraj Wiedermann
Theor. Comput. Sci., 1991

Efficient simulations of nondeterministic computations and their speed-up by the ring of cooperating machines.
[BibTeX]
[DOI]
Juraj Wiedermann
Proceedings of the Fundamentals of Artificial Intelligence Research, 1991

1990
Complexity Issues in Discrete Neurocomputing.
[BibTeX]
[DOI]
Juraj Wiedermann
Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

Normalizing and Accelerating RAM Computations and the Problem of Reasonable Space Measures.
[BibTeX]
[DOI]
Juraj Wiedermann
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989
On the Power of Synchronization.
[BibTeX]
Juraj Wiedermann
J. Inf. Process. Cybern., 1989

1987
Array Processing Machines: An Abstract Model.
[BibTeX]
[DOI]
Jan van Leeuwen
,
Jirí Wiedermann
BIT, 1987

1985
Array processing machines.
[BibTeX]
[DOI]
Jan van Leeuwen
,
Jirí Wiedermann
Proceedings of the Fundamentals of Computation Theory, 1985

1983
Deterministic and Nondeterministic Simulation of the RAM by the Turing Machine.
[BibTeX]
Juraj Wiedermann
Proceedings of the Information Processing 83, 1983

1981
Preserving Total Order in Constant Expected Time.
[BibTeX]
[DOI]
Juraj Wiedermann
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1979
The Complexity of Lexicographic Sorting and Searching.
[BibTeX]
[DOI]
Juraj Wiedermann
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1977
How Good Is the Adversary Lower Bound?
[BibTeX]
[DOI]
Peter Ruzicka
,
Juraj Wiedermann
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

1976
On the Lower Bound for Minimum Comparison Selection.
[BibTeX]
[DOI]
Peter Ruzicka
,
Juraj Wiedermann
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976


  Loading...