Intuition of a Function as an Infinite Dimensional vector Functions as infinite dimensional vectors make sense intuitively after studying much linear algebra, but I only recently realized I've been taught two ways of thinking about them.
For a one dimensional function $f(x)$ you can expand in the basis of polynomials (a taylor series) and you get an infinite dimensional vector where the $i$th component is attached to the basis $x^{i}$, or you can think of the function as a list of all its values over its domain e.g. $ f = ...f(-0.01),f(0),f(0.01)... $ where 0.01 goes to 0. 
In the former case, differentiation and integration become matrix multiplication, which is a nice property, and the latter case makes things like the inner product of functions feel a lot more natural.
But in the former case the length of the vector is the cardinality of the natural numbers, as opposed to the latter where it has the size of the reals, so these clearly aren't equivalent representations.
Is there any relationship between these two ways of thinking of a function as an infinite dimensional vector? 
 A: I think the short answer is "no", the two ways are not related.
The first, where you think of the functions as vectors in a space of functions you care about the formal properties of vectors (adding them and multiplying by scalars). Then you enrich that formality by introducing ideas of limits and convergence. To use the Taylor series to represent a function you have to make sense of infinite sums. That goes well beyond vector space axioms.
In the second view you are thinking of a vector as an abstraction of a list of values, and then thinking of a function as a way to describe a list of values. In that model ordinary real $n$ space is the set of real values functions from $\{1, 2, \ldots, n\}$, the space of real sequences is the set of functions $\mathbb{N} \to \mathbb{R}$ and the space of real functions is the set of functions $\mathbb{R} \to \mathbb{R}$. 
You can extend this second view even further. There's no reason the codomain must be $\mathbb{R}$, or even numerical. In computer science you often refer to essentially arbitrary arrays or lists as "vectors".
A: Sorry to respond to an old question. I am new here.
But just for clarification (because nobody else commented about it) "the length of the vectors in the basis of polynomials" is not the cardinality of natural numbers. It's just how many component the vector has in this representation. The length (norm) can well be finite and then normalized to 1.
So is the case with the second view: Its "length" can be finite and then be normalized to 1 (e.g. for QM wave-functions which can be viewed as vectors in Hilbert-space).
What is different between the two views, is the number of components (not the vector norm) which is not required to be of the same cardinality in different representations (the vector norm, however, could well be finite in both representations).
And yes, I think the two representations ARE related: They are basically representations of the same information in different bases. Just as the Fourier transform of a function (using the Fourier basis instead of polynomials now) contains the same information as the original function. They are basically different representations of the same abstract entity in different representations.
