11716 search results - page 207 / 2344 » Computable symbolic dynamics |
121
click to vote
AISC
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. McDermott [12,13] introduced the concept "Artificial Intelligence meets Natural Stupidity". In this paper, we explore how Artificial Intelligence and Symbolic C...
140
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
131
click to vote
FUIN
2006
15 years 6 months ago
2006
Abstract. We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered traject...
129
click to vote
MOC
1998
15 years 6 months ago
1998
A method to calculate numerically the multiplicity of a solution to a system of algebraic equations is presented. The method is an application of Zeuthen’s rule which gives the m...
170
click to vote
JUCS
2008
15 years 6 months ago
2008
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...