#### Filter Results:

- Full text PDF available (18)

#### Publication Year

1976

2017

- This year (2)
- Last 5 years (15)
- Last 10 years (30)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Cell Type

#### Key Phrases

Learn More

- Jan van Leeuwen, Jirí Wiedermann
- SOFSEM
- 2001

- Jirí Wiedermann
- Theor. Comput. Sci.
- 2004

The -rst attempts concerning formalization of the notion of fuzzy algorithms in terms of Turing machines are dated in late 1960s when this notion was introduced by Zadeh. Recently, it has been observed that corresponding so-called classical fuzzy Turing machines can solve undecidable problems. In this paper we will give exact recursion-theoretical… (More)

- Jirí Wiedermann
- Computers and Artificial Intelligence
- 2002

- Jirí Wiedermann, Jan van Leeuwen
- CiE
- 2008

Classical models of computation no longer fully correspond to the current notions of computing in modern systems. Even in the sciences, many natural systems are now viewed as systems that compute. Can one devise models of computation that capture the notion of computing as seen today and that could play the same role as Turing machines did for the classical… (More)

- Jirí Wiedermann
- IMYCS
- 1990

- Jan van Leeuwen, Jirí Wiedermann
- MFCS
- 2000

Many IT-systems behave very differently from classical machine models: they interact with an unpredictable environment, they never terminate, and their behavior changes over time. Wegner [25,26] (see also [28]) recently argued that the power of interaction goes beyond the Church-Turing thesis. To explore interaction from a computational viewpoint, we… (More)

- Jirí Wiedermann, Jan van Leeuwen
- UMC
- 2002

Recent research in theoretical physics on ‘Malament-Hogarth space-times’ indicates that so-called relativistic computers can be conceived that can carry out certain classically undecidable queries in finite time. We observe that the relativistic Turing machines which model these computations recognize precisely theΔ2−sets of the Arithmetical Hierarchy. In a… (More)

- Jan van Leeuwen, Jirí Wiedermann
- IFIP TCS
- 2000

- Jirí Síma, Jirí Wiedermann
- J. ACM
- 1998

A finite automaton—the so-called neuromaton, realized by a finite discrete recurrent neural network, working in parallel computation mode, is considered. Both the size of neuromata (i.e., the number of neurons) and their descriptional complexity (i.e., the number of bits in the neuromaton representation) are studied. It is proved that a constraint… (More)

- Jirí Wiedermann, Jan van Leeuwen
- AI Commun.
- 2002

The computational potential of artificial living systems can be studied without knowing the algorithms that govern their behavior. Modeling single organisms by means of socalled cognitive transducers, we will estimate the computational power of AL systems by viewing them as conglomerates of such organisms. We describe a scenario in which an artificial… (More)