请输入您要查询的字词:

 

单词 RecursivelyEnumerable
释义

recursively enumerable


For a languagePlanetmathPlanetmath L, TFAE:

  • There exists a Turing machineMathworldPlanetmath f such that x.(xL)the computation f(x) terminates.

  • There exists a total recursive function f:L which is onto.

  • There exists a total recursive function f:L which is one-to-one and onto.

A language L fulfilling any (and therefore all) of the above conditions is called recursively enumerablePlanetmathPlanetmath.

Examples

  1. 1.

    Any recursive language.

  2. 2.

    The set of encodings of Turing machines which halt when given no input.

  3. 3.

    The set of encodings of theorems of Peano arithmeticMathworldPlanetmathPlanetmath.

  4. 4.

    The set of integers n for which the hailstone sequence starting at n reaches 1. (We don’t know if this set is recursive, or even if it is N; but a trivial program shows it is recursively enumerable.)

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 21:11:05