Blum axioms (Q4059945)

From Wikidata
Jump to navigation Jump to search
axioms for complexity measure on computable functions: for a Gödel numbering φᵢ of computable functions and a computable function Φ on ℕ valued in the computable functions, ① the domain of φᵢ and Φᵢ coincide; ② the set {(i,x,t)|Φᵢ(x)=t} is recursive
edit
Language Label Description Also known as
English
Blum axioms
axioms for complexity measure on computable functions: for a Gödel numbering φᵢ of computable functions and a computable function Φ on ℕ valued in the computable functions, ① the domain of φᵢ and Φᵢ coincide; ② the set {(i,x,t)|Φᵢ(x)=t} is recursive

    Statements

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit