A 1952 result of Davenport and Erdős states that if p is an integer-valued polynomial, then the real number 0.p(1)p(2)p(3)… is Borel normal in base ten. A later result of Nakai and Shiokawa extends this result to polynomials with arbitrary real coefficients and all bases b ≥ 2. It is well-known that finite-state dimension, a finite-state effectivization of the classical Hausdorff dimension, characterizes the Borel normal sequences as precisely those sequences of finite-state dimension 1. For an infinite set A of natural numbers, and a base b ≥ 2, the base-b Copeland-Erdős sequence of A, CE_b(A), is the infinite sequence obtained by concatenating the base-b expansions of the numbers in A in increasing order. In this work we investigate the possible relationships between the finite-state dimensions of CE_b(A) and CE_b(p(A)) where p is a polynomial. We show that, if the polynomial is permitted to have arbitrary real coefficients, then for any s,s^′ in the unit interval, there is a set A of natural numbers and a linear polynomial p so that the finite-state dimensions of CE_b(A) and CE_b(p(A)) are s and s^′ respectively. The corresponding result for strong finite-state dimension is also shown. We demonstrate that linear polynomials with rational coefficients do not change the finite-state dimension of any Copeland-Erdős sequence, but there exist polynomials with rational coefficients of every larger integer degree that change the finite-state dimension of some sequence. We also prove the surprising fact that there exist sets A and integer-valued monomials p such that CE_b(A) is normal, but CE_b(p(A)) has finite-state dimension strictly less than one.

Effective versions of strong measure zero sets are developed for various levels of complexity and computability. It is shown that the sets can be equivalently defined using a generalization of supermartingales called odds supermartingales, success rates on supermartingales, predictors, and coverings. We show Borel's conjecture of a set having strong measure zero if and only if it is countable holds in the time and space bounded setting. At the level of computability this does not hold. We show the computable level contains sequences at arbitrary levels of the hyperarithmetical hierarchy by proving a correspondence principle yielding a condition for the sets of computable strong measure zero to agree with the classical sets of strong measure zero. An algorithmic version of strong measure zero using lower semicomputability is defined. We show that this notion is equivalent to the set of NCR reals studied by Reimann and Slaman, thereby giving new characterizations of this set. Effective strong packing dimension zero is investigated requiring success with respect to the limit inferior instead of the limit superior. It is proven that every sequence in the corresponding algorithmic class is decidable. At the level of computability, the sets coincide with a notion of weak countability that we define.