2623 search results - page 251 / 525 » Universal Learning Theory |
155
click to vote
CALCO
2009
Springer
16 years 1 months ago
2009
Springer
d abstract) Sam Staton Computer Laboratory, University of Cambridge Abstract. A labelled transition system can be understood as a coalgebra for a particular endofunctor on the cate...
197
click to vote
CALCO
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
168
click to vote
IJCNN
2007
IEEE
16 years 28 days ago
2007
IEEE
— The relationship between subsymbolic neural networks and symbolic logical systems is discussed from the point of view of the account of computational science by Paul Humphreys ...
160
click to vote
SAC
2006
ACM
16 years 17 days ago
2006
ACM
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
185
click to vote
ACRI
2004
Springer
16 years 21 hour ago
2004
Springer
Abstract. This paper reviews the history of embedded, evolvable selfreplicating structures implemented as cellular automata systems. We relate recent advances in this field to the...