Why is it impossible to find a specified value in a sorted array faster than O(log n)?

Pretty new to cs here… in closing to a lecture, my AP computer science teacher mentioned the comparison model for finding a specified value in a sorted array is “big omega (log n)” which as I understand it, means it’s impossible to accomplish this task any faster than O(log n)? Can you help me understand why? Thank you!