214 search results - page 5 / 43 » On Turing machines, dynamical systems and the Atiyah problem |
GLOBECOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract—Cognitive radio is a key enabling technology of dynamic spectrum access for exploiting unused spectrum resources. This article focuses on modeling the opportunity for ce...
110
click to vote
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
AE
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We aim to construct an automatic system for the discovery of collision-based universal cellular automata that simulate Turing machines in their space-time dynamics using ...
76
Voted
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...