13621 search results - page 359 / 2725 » Computability and Complexity in Self-assembly |
180
click to vote
CIE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
187
click to vote
TROB
2002
2002
DPAC: an object-oriented distributed and parallel computing framework for manufacturing applications
15 years 6 months ago
Parallel and distributed computing infrastructure are increasingly being embraced in the context of manufacturing applications, including real-time scheduling. In this paper, we pr...
227
click to vote
LOGCOM
2010
15 years 1 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
144
click to vote
PVLDB
2008
15 years 6 months ago
2008
The measure of similarity between objects is a very useful tool in many areas of computer science, including information retrieval. SimRank is a simple and intuitive measure of th...
179
click to vote
CIE
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...