Given an element $m$ in a coalgebra $C$, there always exists a finite-dimensional subcoalgebra $D \subset C$ containing $m$; this is the fundamental theorem for coalgebras. This obviously isn't the case for algebras. However, to make a proper analogue of this theorem for algebras, one should formulate this theorem using arrows and then dualize. An element of $C$ determines a linear map $F:\mathbb{k} \to C$ and vice versa. The fundamental theorem then becomes:
For any linear map $F: \mathbb{k} \to C$ there exists a map $G:\mathbb{k} \to D$, such that $i \circ G=F$, for $D$ some finite dimensional coalgebra, and $i$ an injective map of coalgebras.
Dualizing to algebras, one easily sees that the statement becomes equivalent to the question: is any linear map $f:A \to \mathbb{k}$ zero on an ideal of finite codimension, where $A$ is any algebra. Spelling this out for $k[x]$, one is led to the question: do there exist sequences $(f_{n})_{n}$ that do not satisfy any recursion equation. Does anyone know about a sequence like this, or an existence proof?
A perhaps less sensical question: does the reformulation of the fundamental theorem in terms of algebras have some nice geometrical interpretation? Say in the case of affine algebras?