UTM theorem
id:
utm-theorem-299-6439375
title:
UTM theorem
text:
In computability theory, the UTM theorem, or universal Turing machine theorem, is a basic result about Gödel numberings of the set of computable functions. It affirms the existence of a computable universal function, which is capable of calculating any other computable function. The universal function is an abstract version of the universal Turing machine, thus the name of the theorem. Roger's equivalence theorem provides a characterization of the Gödel numbering of the computable functions in t
brand slug:
wiki
category slug:
encyclopedia
description:
Affirms the existence of a computable universal function
original url:
https://en.wikipedia.org/wiki/UTM_theorem
date created:
date modified:
2024-01-26T01:42:54Z
main entity:
{"identifier":"Q7902910","url":"https://www.wikidata.org/entity/Q7902910"}
image:
fields total:
13
integrity:
14