1995 search results - page 52 / 399 » The Chemical Abstract Machine |
MSCS
2010
13 years 6 months ago
2010
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...
GECCO
2010
Springer
13 years 7 months ago
2010
Springer
State machines are a popular method of representing a syshigh level of abstraction that enables developers to gain an overview of the system they represent and quickly understand ...
JAR
2006
13 years 7 months ago
2006
We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem proving systems such as AC...
INFORMATICALT
2010
13 years 5 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 ...
FINTAL
2006
13 years 11 months ago
2006
Abstract. This paper presents a machine learning approach for paraphrase identification which uses lexical and semantic similarity information. In the experimental studies, we exam...