Dr. Alex Feldman graduated in 1985 with a Ph.D. in Mathematics, and a minor in Computer Science, from the University of Wisconsin-Madison. His dissertation was entitled "Recursion Theory in a Partial Order with Greatest Lower Bound". He served as a Professor of Mathematics and Computer Science at Boise State University from 1989-2007. In the summer of 2009, Dr. Feldman served as an NCPACE Instructor for Central Texas College (Kileen, TX)where he taught 3 sections of Intermediate Algebra during an 8 week session on the USS John Paul Jones (DDG 53) in the Persian Gulf.
Articles & Conference Proceedings
Using Online Assessment and Practice to Achieve Better Retention and Placement in Precalculus and Calculus (with Doug Bullock and Janet Callahan), 119th ASEE Annual Conference and Exposition (2012)
In the fall of 2008 Boise State University began using an online assessment tool, ALEKS1,...
Prey Behavior, Age-Dependent Vulnerability, and Predation Rates (with Susan Lingle, Mark S. Boyce, and W. Finbarr Wilson), The American Naturalist (2008)
Variation in the temporal pattern of vulnerability can provide important insights into predator-prey relationships and...
Recursion Theory in a Lower Semilattice, The Journal of Symbolic Logic (1992)
In ยง3 we construct a universal, N0-categorical recursively presented partial order with greatest lower bound...