Question: are all finite languages decidable?
Answer: If A is finite, it is decidable because all finite languages are decidable (just hardwire each of the strings into the TM). If A is infinite, a TM M that decides A operates as follows.