Some Theory ?'s

[jutah]

Can someone please explain to me what exactly Reducibility is, and what it means to say that a language'A' is reducible to a language B if there is a Turing computable function f:Z->Z such that for every w, wEA if and only if f(w)EB?
Also could someone explain what exactly class NP is and what it means to have a polynomial time verifier?

thanks
jutah

[kmj]

I don't have any straight answers for you, but you may get some help on NP and polynomial time here (http://hissa.nist.gov/dads/).