AbstractIn a previous paper, we used Maurer machines to model and analyse micro-architectures. In the current paper, we investigate the connections between Turing machines and Maurer machines with the purpose to gain an insight into computability issues relating to Maurer machines. We introduce ways to simulate Turing machines on a Maurer machine which, dissenting from the classical theory of computability, take into account that in reality computations always take place on finite machines. In one of those ways, multi-threads and thread forking have an interesting theoretical application
Abstract. We develop an algebraic theory of threads, synchronous co-operation of threads and interac...
In this thesis we shall present and develop the concept of a theory machine. Theory machines describ...
Abstract. We formalise results from computability theory in the theorem prover Isabelle/HOL. Followi...
In a previous paper, we used Maurer machines to model and analyse micro-architectures. In the curren...
Abstract. Maurer machines are much closer to real computers than Turing machines. Computer instructi...
We present the development of a theory of stored threads and their execution. The work builds upon M...
We investigate basic issues concerning stored threads and their execution, building upon Maurer’s mo...
We model micro-architectures with non-pipelined instruction processing and pipelined instruction pro...
We develop an algebraic theory of threads, synchronous cooperation of threads and interaction of thr...
Turing machines have been well studided in the context of Computability theory, looking at computati...
In the 1960s Gisbert Hasenjaeger built Turing Machines from electromechanical relays and uniselector...
In the 1960s Gisbert Hasenjaeger built Turing Machines from electromechanical relays and uniselector...
Turing Machine is one of the earliest device in programming to describe or interpret a model for alg...
This is a summary of a talk given at the Logic Institute on July 9. Theoretical studies of computing...
AbstractThe principal ideas of a universal computer are gradually introduced into a functional model...
Abstract. We develop an algebraic theory of threads, synchronous co-operation of threads and interac...
In this thesis we shall present and develop the concept of a theory machine. Theory machines describ...
Abstract. We formalise results from computability theory in the theorem prover Isabelle/HOL. Followi...
In a previous paper, we used Maurer machines to model and analyse micro-architectures. In the curren...
Abstract. Maurer machines are much closer to real computers than Turing machines. Computer instructi...
We present the development of a theory of stored threads and their execution. The work builds upon M...
We investigate basic issues concerning stored threads and their execution, building upon Maurer’s mo...
We model micro-architectures with non-pipelined instruction processing and pipelined instruction pro...
We develop an algebraic theory of threads, synchronous cooperation of threads and interaction of thr...
Turing machines have been well studided in the context of Computability theory, looking at computati...
In the 1960s Gisbert Hasenjaeger built Turing Machines from electromechanical relays and uniselector...
In the 1960s Gisbert Hasenjaeger built Turing Machines from electromechanical relays and uniselector...
Turing Machine is one of the earliest device in programming to describe or interpret a model for alg...
This is a summary of a talk given at the Logic Institute on July 9. Theoretical studies of computing...
AbstractThe principal ideas of a universal computer are gradually introduced into a functional model...
Abstract. We develop an algebraic theory of threads, synchronous co-operation of threads and interac...
In this thesis we shall present and develop the concept of a theory machine. Theory machines describ...
Abstract. We formalise results from computability theory in the theorem prover Isabelle/HOL. Followi...