Search results

Results 1 – 20 of 15,752
Advanced search

Search in namespaces:

There is a page named "Talk:Computable set" on Wikipedia

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Right now, Computable set redirects to recursive set. Are there any objections if I reverse that redirect? CMummert 23:35, 16 July 2006 (UTC) The article...
    10 KB (1,423 words) - 23:51, 8 March 2024
  • definition of a computable function: A partial function f :⊆ N → N {\displaystyle f:\subseteq \mathbb {N} \to \mathbb {N} } is called computable if the graph...
    21 KB (3,333 words) - 23:49, 8 March 2024
  • think "Computable" should redirect here - I think it would be better to have a disambiguation page, with links to computable set, computable real, computable...
    2 KB (241 words) - 22:16, 30 January 2024
  • main "computable number" page. The set of numbers described by this definition is not even closed under addition (plus, you would get a different set of...
    43 KB (6,733 words) - 23:49, 8 March 2024
  • definition of a computable function: A partial function f :⊆ N → N {\displaystyle f:\subseteq \mathbb {N} \to \mathbb {N} } is called computable if the graph...
    44 KB (6,857 words) - 23:51, 8 March 2024
  • redundant with it. This page covers arithmetical sets in general, much like computable set covers computable sets in general. The hierarchy article is all about...
    7 KB (945 words) - 23:12, 14 January 2024
  • I moved Index set (recursion theory) to Index set (computability) per the discussion here. --Jordan Mitchell Barrett (talk) 00:59, 26 April 2021 (UTC)...
    440 bytes (24 words) - 21:40, 3 February 2024
  • correct definition in computable number a couple of months ago. There is a link to Turing's original paper at the end of computable number. Note that the...
    46 KB (7,438 words) - 05:04, 13 July 2024
  • instruction set computing, or RISC (pronounced 'risk', /ɹɪsk/), is a CPU design strategy based on the insight that a simplified instruction set provides...
    12 KB (1,604 words) - 07:21, 16 July 2024
  • (that is, a set is Σ 1 0 {\displaystyle \Sigma _{1}^{0}} if there is a computable set S of finite sequences of naturals such that the given set is the union...
    3 KB (389 words) - 01:47, 8 February 2024
  • Reduced instruction set computer — Andy W. (talk) 16:27, 24 May 2017 (UTC) Complex instruction set computing → Complex instruction set computer – For the...
    26 KB (3,985 words) - 22:04, 30 January 2024
  • architecture article is pretty good: "Instruction set architecture, or ISA, is the abstract image of a computing system that is seen by a machine language (or...
    97 KB (14,583 words) - 05:48, 24 April 2024
  • 19 March 2014 (UTC) Essentially the same article as No instruction set computing, except with less information. Very little information differentiates...
    2 KB (207 words) - 02:45, 7 February 2024
  • page. Soare has been on a campaign to use "computable" not "recursive". Recursive functions are computable functions - they are the same thing. Martin...
    28 KB (3,915 words) - 23:51, 8 March 2024
  • basically acted as an echo chamber. Send out a tone, and you get it back a set period of time, (not long,) after. Do you find it stranger that a television...
    18 KB (2,536 words) - 13:35, 19 July 2024
  • computing.pdf to http://www.research.ibm.com/autonomic/manifesto/autonomic_computing.pdf When you have finished reviewing my changes, please set the...
    10 KB (1,403 words) - 12:25, 26 January 2024
  • definition and is ambiguous. It should be set aside on a disambiguity page, and/or taken out of this article. A computing platform consists of a specific type...
    10 KB (1,436 words) - 09:06, 10 June 2024
  • Turing reductions. Every computable set is Turing reducible to every other computable set (just ignore the oracle). So unless every set is in P, L, NL, and...
    12 KB (1,858 words) - 05:43, 9 March 2024
  • whatsoever. Relative computability. If a set A is computable by an oracle Turing machine using oracle B then A is relatively computable from B. Similar, and...
    70 KB (10,662 words) - 15:23, 22 August 2009
  • the recursive/computable definition I believe it only differs from the usual definition for n = 0 {\displaystyle n=0} where the computable-definition version...
    24 KB (3,537 words) - 01:02, 3 April 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)