I’m updating because I think you outline a very useful concept here. Narrow algorithms can be made much more general given a good ‘algorithm switcher’. A canny switcher/coordinator program can be given a task and decide which of several narrow programs to apply to it. This is analogous to the IBM Watson system that competed in Jeopardy and to the human you describe using a PC to switch between applications. I often forget about this technique during discussions about narrow machine learning software.
I’m updating because I think you outline a very useful concept here. Narrow algorithms can be made much more general given a good ‘algorithm switcher’. A canny switcher/coordinator program can be given a task and decide which of several narrow programs to apply to it. This is analogous to the IBM Watson system that competed in Jeopardy and to the human you describe using a PC to switch between applications. I often forget about this technique during discussions about narrow machine learning software.