The Birkhoff Ergodic Theorem concludes that time averages, i.e., Birkhoff averages, B N (f ) ∶= Σ N −1 n=0 f (x n ) N of a function f along a length N ergodic trajectory (x n ) of a function T converge to the space average ∫ f dµ, where µ is the unique invariant probability measure. Convergence of the time average to the space average is slow. We use a modified average of f (x n ) by giving very small weights to the "end" terms when n is near 0 or N − 1. When (x n ) is a trajectory on a quasiperiodic torus and f and T are C ∞ , our Weighted Birkhoff average (denoted WB N (f )) converges "super" fast to ∫ f dµ with respect to the number of iterates N , i.e. with error decaying faster than N −m for every integer m. Our goal is to show that our Weighted Birkhoff average is a powerful computational tool, and this paper illustrates its use for several examples where the quasiperiodic set is one or two dimensional. In particular, we compute rotation numbers and conjugacies (i.e. changes of variables) and their Fourier series, often with 30-digit accuracy. d j=1 a j ρ j = 0, then every a j = 0. We then say such a ρ is irrational.Let T be a C ∞ quasiperiodic map. The quasiperiodicity persists for most small perturbations by the Kolmogorov-Arnold-Moser theory. We believe that quasiperiodicity is one of only three types of invariant sets with a dense trajectory that can occur in typical smooth maps. The other two types are periodic sets and chaotic sets. See [1] for the statement of our formal conjecture of this triumvirate. For example, quasiperiodicity occurs in a system of weakly coupled oscillators, in which there is an invariant smooth *