Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"Entscheidungsproblem"”.
-
A minimal reduction class for the Entscheidungsproblem
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1962.
-
Turing-Completeness as Medium: Art, Computers and Intentionality
… Computable Numbers, with an Application to the Entscheidungsproblem". Turing described a machine which can “simulate” any other computing machine including all modern computers. His machine is here used to propose a ‘Turing-complete medium’ of art, of which every computer is a computationally …
-
Decision problems over infinite graphs : higher order pushdown systems and synchronized products
The extension of formal verification methods to infinite models requires classes of graphs which are finitely representable and for which the model checking problem is decidable. We consider three approaches to define classes of finitely representable graphs: internal representations as …
-
On combinatorial search problems which involve graphs
Combinatorial search problems are represented as follows: An finite set M is searched for an object x by selecting a subset of a finite set of tests F such that they identify x uniquely. In this thesis 3 types of search problems are treated by solving some special problems involving graphs as …