INFORMATICALT

2010

13 years 1 months ago
2010

The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...

IGPL

2006

13 years 4 months ago
2006

Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...

ENTCS

2006

13 years 4 months ago
2006

It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...

FSS

2008

13 years 4 months ago
2008

We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively...

AMC

2006

13 years 4 months ago
2006

Church thesis and its variants say roughly that all reasonable models of computation do not have more power than Turing machines. In a contrapositive way, they say that any model ...

BIRTHDAY

2010

Springer

13 years 5 months ago
2010

Springer

Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...

MCU

1998

13 years 5 months ago
1998

A BSS machine is -uniform if it does not use exact tests; such machines are equivalent (modulo parameters) to Type 2 Turing machines. We define a notion of closure related to Turi...

CATS

2006

13 years 5 months ago
2006

The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...

AIML

2004

13 years 5 months ago
2004

This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...

EUROGP

2008

Springer

13 years 6 months ago
2008

Springer

Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...