• Breaking News

    Thursday, December 30, 2021

    Recursive enumerable languages Computer Science

    Recursive enumerable languages Computer Science


    Recursive enumerable languages

    Posted: 30 Dec 2021 05:52 AM PST

    a language A is recursive enumerable, if the elements can be enumerated with a function f(n) So w_0 = f(0), w_1= f(1), ...

    do you guys have a small example with specific values, to show how a language can be enumerated? I have a hard time to grasp this concept...probably its way easier than i think...

    submitted by /u/AnxiousBane
    [link] [comments]

    No comments:

    Post a Comment