This paper presents persistent Turing machines (PTMs), a new way of interpreting Turing-
machine computation, based on dynamic stream semantics. A PTM is a Turing machine that …

Abstract Persistent Turing Machines (PTMs) are multitape machines with a persistent
worktape preserved between interactions, whose inputs and outputs are dynamically …

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 …

Many embedded systems behave very differently from classical machine models: they
interact with an unpredictable environment, they are “always on”, and they change over time …

This paper discusses three computation-related results in the study of electoral systems: 1.
Determining the winner in Lewis Carroll's 1876 electoral system is complete for parallel …

VXWYb acWY d1e e@ fhgie@ Yqp Vsrutvxwyq re ev WYY X d fe7 gc 5 h ik j3h e7 mlm fino
pq gXo@ rX st df ovuc w sigXpqxx fydpz|{cr}@ mlX@ g mrh x@ j3" st dfourfum 8 fum f …

We present a probabilistic data model for complex values. More precisely, we introduce
probabilistic complex value relations, which combine the concept of probabilistic relations …

Question-answering systems like Watson beat humans when it comes to processing speed
and memory. But what happens if we compensate for this? What are the fundamental …

Cognitive automata model the human capability of processing information and giving
feedback. We augment cognitive automata with a form of intelligence, by giving them the …

We take a look at the second part of the robot-selflocalizationproblem. The hypotheses
generated in a solution of the first part of the problem will be efficient reduced with the …