Results

**1 - 2**of**2**### On the Halting Problem of Finite-State Programs ⋆

"... Abstract. The undecidability of the halting problem is a well-known research result of theoretical computer science, dating back to Turing’s work in 1936. Nevertheless, it is commonly known that the halting problem on finite-state computer systems is decidable. Thus, any undecidability proof given f ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract. The undecidability of the halting problem is a well-known research result of theoretical computer science, dating back to Turing’s work in 1936. Nevertheless, it is commonly known that the halting problem on finite-state computer systems is decidable. Thus, any undecidability proof given for the halting problem must imply that it does not apply to finite-state computer systems. The aim of this paper is to deepen the understanding of why the undecidability proofs of the halting problem cannot be instantiated as finite-state programs. To bridge the gap between theory and practice, the arguments formalisms. 1

### Introducing the Parallel Random Access Machine together with FORTRAN 90/95

"... Parallelism is an interesting theme in many areas of computer science and its applications. Nevertheless, students try very hard to design parallel solutions to problems of which they know efficient sequential solutions. Studying the theoretical foundations may facilitate understanding parallelism. ..."

Abstract
- Add to MetaCart

(Show Context)
Parallelism is an interesting theme in many areas of computer science and its applications. Nevertheless, students try very hard to design parallel solutions to problems of which they know efficient sequential solutions. Studying the theoretical foundations may facilitate understanding parallelism. Nevertheless, it seems necessary to make run the algorithms in order to bridge the gap between theory and practice. By way of example, we show how to make students familiar with SIMD parallelism both by introducing the theory and by implementing the algorithms in a suitable programming language. 1