When these definitions were shown equivalent to Turing's formalization involving Turing machines, it became clear that a new concept – the computable function – had been discovered, and that this definition was robust enough to admit numerous independent characterizations.
Da disse definitioner blev vist at være ækvivalente med Turings formalisering, involverende Turing-maskiner, blev det klart at et nyt begreb – den beregnelige funktion – var blevet opdaget, og at denne definition var tilstrækkelig robust til at tillade adskillige, uafhængige karakteristiker.