Recursive enumerability of N-Cuil Problem
Forum » Cuil Unit Forum / Cuil Theory Academics » Recursive enumerability of N-Cuil Problem
Started by: Rich Frankel (guest)
Date: 05 Jun 2009 08:27
Number of posts: 2
rss icon RSS: New posts
Summary:
Let the N-Cuil Problem be as follows: Given two situations x and x', and some constant N >=0, determine whether x' is a member of k‽(x), for any k such that 0 <= k <= N.
New Post
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License