Computably enumerable set: Revision history

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

curprev 00:4400:44, 19 March 2023‎ Citation bot talk contribs‎ 9,228 bytes −54‎ Alter: url. URLs might have been anonymized. | Use this bot. Report bugs. | Suggested by AManWithNoPlan | #UCB_CommandLine undo

curprev 22:0022:00, 3 August 2022‎ DontWannaDoThis talk contribs‎ 9,282 bytes +38‎ No edit summary undo

curprev 09:0809:08, 29 July 2022‎ Primefac talk contribs‎ m 9,244 bytes 0‎ Primefac moved page Computably enumerable to Computably enumerable set: WP:NOUN -- this certainly ought to be non-controversial undo

curprev 21:3021:30, 6 February 2022‎ Qwerfjkl (bot) talk contribs‎ m 9,244 bytes 0‎ Capitalising short description "mathematical logic concept" per WP:SDFORMAT (via Bandersnatch) undo

curprev 20:2520:25, 29 November 2021‎ Mathnerd314159 talk contribs‎ 9,244 bytes +412‎ move sigma definition to equivalent formulations section, add citation, add see also section undo

curprev 18:5118:51, 13 October 2021‎ Keviny720 talk contribs‎ m 8,832 bytes −1‎ typo fix undo

curprev 03:4103:41, 15 June 2021‎ Hellacioussatyr talk contribs‎ 8,833 bytes −5‎ →‎Examples undo Tags: Mobile edit Mobile web edit Advanced mobile edit
curprev 03:3903:39, 15 June 2021‎ Hellacioussatyr talk contribs‎ 8,838 bytes +61‎ →‎Equivalent formulations undo Tags: nowiki added Mobile edit Mobile web edit Advanced mobile edit

curprev 11:4811:48, 30 April 2021‎ Jordan Mitchell Barrett talk contribs‎ m 8,777 bytes 0‎ fix typo undo Tag: Visual edit
curprev 11:4611:46, 30 April 2021‎ Jordan Mitchell Barrett talk contribs‎ 8,777 bytes −178‎ Change "recursive" -> "computable" per discussion here: https://en.wikipedia.org/wiki/Wikipedia_talk:WikiProject_Mathematics#Proposal:_change_terminology_from_%22recursive%22_to_%22computable%22 undo Tag: Visual edit

curprev 23:3423:34, 29 April 2021‎ Fences and windows talk contribs‎ m 8,955 bytes 0‎ Fences and windows moved page Recursively enumerable set to Computably enumerable: Consensus on terminology change from "recursive" to "computable" - discussion here undo

curprev 18:5618:56, 21 April 2021‎ JRSpriggs talk contribs‎ 8,955 bytes −53‎ Undid revision 1019054895 by Jordan Mitchell Barrett (talk) changed meaning of sentence without any supporting source undo Tag: Undo
curprev 08:5308:53, 21 April 2021‎ D.Lazard talk contribs‎ 9,008 bytes +293‎ →‎top: clarification and adding context undo
curprev 08:3108:31, 21 April 2021‎ Jordan Mitchell Barrett talk contribs‎ m 8,715 bytes +53‎ →‎Equivalent formulations: simplified verbose description undo Tags: Reverted Visual edit

curprev 00:0900:09, 14 April 2021‎ Dokidaki-ylc talk contribs‎ m 8,662 bytes +39‎ Add common synonyms (listable, partially decidable) for computably enumerable set undo Tag: Visual edit

curprev 09:3309:33, 13 November 2020‎ JRSpriggs talk contribs‎ 8,623 bytes −38‎ lead: its output is simply a list of all the members of ''S'': ''s''1, ''s''2, ''s''3, ... . If ''S'' is infinite, this algorithm will run forever. undo

curprev 12:2612:26, 12 November 2020‎ Cheater no1 talk contribs‎ 8,661 bytes +49‎ →‎top: clarification is needed on when it is necessary to run forever undo Tag: Visual edit

curprev 15:4915:49, 29 April 2020‎ Tea2min talk contribs‎ m 8,612 bytes 0‎ Skip redirect from Domain (mathematics) to Domain of a function. May turn Domain (mathematics) into a redirect to Domain (disambiguation)#Mathematics later. undo

curprev 06:1106:11, 27 August 2019‎ 62.74.10.233 talk‎ 8,612 bytes −6‎ No edit summary undo Tags: Mobile edit Mobile web edit

curprev 08:1508:15, 8 July 2019‎ LaundryPizza03 talk contribs‎ 8,618 bytes +73‎ →‎Properties undo

curprev 14:3514:35, 23 May 2019‎ A3nm talk contribs‎ 8,545 bytes +10‎ enumeration algorithm undo Tag: 2017 wikitext editor

curprev 20:3920:39, 16 May 2019‎ Joel Brennan talk contribs‎ m 8,535 bytes +2‎ →‎Equivalent formulations undo
curprev 20:3820:38, 16 May 2019‎ Joel Brennan talk contribs‎ m 8,533 bytes −30‎ →‎Equivalent formulations undo

curprev 08:2708:27, 25 October 2018‎ Tsirel talk contribs‎ 8,563 bytes +5‎ Undid revision 865628967 by 50.193.35.209 (talk) it was correct and more informative: n=9 is enough undo Tag: Undo
curprev 04:1104:11, 25 October 2018‎ 50.193.35.209 talk‎ 8,558 bytes −5‎ →‎Equivalent formulations undo

curprev 09:5209:52, 5 October 2018‎ ClueBot NG talk contribs‎ m 8,563 bytes −130‎ Reverting possible vandalism by 61.0.225.27 to version by Trovatore. Report False Positive? Thanks, ClueBot NG. (3498094) (Bot) undo Tag: Rollback
curprev 09:5209:52, 5 October 2018‎ 61.0.225.27 talk‎ 8,693 bytes +130‎ its true undo Tag: Visual edit

curprev 04:4104:41, 22 February 2018‎ Trovatore talk contribs‎ 8,563 bytes +49‎ {{short description}} undo

curprev 22:5222:52, 19 June 2017‎ CBM talk contribs‎ m 8,514 bytes +12‎ Manually reviewed edit to replace magic words per local rfc undo

curprev 03:4703:47, 4 April 2015‎ Verdana Bold talk contribs‎ 8,502 bytes −46‎ →‎Formal definition: don't include synonym of something else in a definition undo Tag: Visual edit

curprev 09:0009:00, 12 March 2015‎ JRSpriggs talk contribs‎ 8,548 bytes +155‎ Undid revision 651010198 by Verdana Bold (talk) not clear undo
curprev 06:4406:44, 12 March 2015‎ Verdana Bold talk contribs‎ 8,393 bytes −155‎ don't use the word "recursive" to define "recursively enumerable," and define it in a simpler way undo Tag: Visual edit

curprev 05:1405:14, 24 February 2015‎ JRSpriggs talk contribs‎ 8,548 bytes +1‎ lead: undo two edits by DigitalRunes "algorithm" is a more standard word here than "procedure" undo

curprev 03:0903:09, 23 February 2015‎ DigitalRunes talk contribs‎ 8,547 bytes −1‎ No edit summary undo
curprev 03:0703:07, 23 February 2015‎ DigitalRunes talk contribs‎ 8,548 bytes 0‎ No edit summary undo

curprev 14:4614:46, 15 November 2014‎ 2.233.222.134 talk‎ 8,548 bytes +1‎ →‎Equivalent formulations undo

curprev 23:3723:37, 18 October 2014‎ Hyacinth talk contribs‎ 8,547 bytes +13‎ →‎References: {{Mathematical logic}} undo

curprev 07:4207:42, 4 October 2014‎ Omnipaedista talk contribs‎ 8,534 bytes +67‎ rv own edit undo

curprev 17:0517:05, 28 September 2014‎ Omnipaedista talk contribs‎ 8,467 bytes −63‎ per MOS:DASH undo

curprev 10:0510:05, 5 September 2014‎ Omnipaedista talk contribs‎ 8,530 bytes +68‎ add dab hatnote undo

curprev 07:0507:05, 17 January 2014‎ JRSpriggs talk contribs‎ 8,462 bytes −2‎ Undid revision 590970229 by 103.250.150.59 (talk) not a helpful edit undo

curprev 14:2414:24, 16 January 2014‎ 103.250.150.59 talk‎ 8,464 bytes +2‎ →‎Formal definition undo

curprev 12:5112:51, 15 December 2013‎ Kiwibird talk contribs‎ 8,462 bytes +139‎ more explicitly why recursive is more restrictive than r.e. undo

curprev 18:1018:10, 30 November 2013‎ Jochen Burghardt talk contribs‎ 8,323 bytes +546‎ →‎Examples: suggest picture for r.e. of halting TMs undo

curprev 12:0412:04, 10 March 2013‎ JRSpriggs talk contribs‎ 7,777 bytes +23‎ Undid revision 543090809 by 2607:F140:400:2186:A96B:DD5B:1FB:FDDE (talk) there is no standard definition of RE for other universes. undo

curprev 21:5921:59, 9 March 2013‎ 2607:f140:400:2186:a96b:dd5b:1fb:fdde talk‎ 7,754 bytes −23‎ A recursively enumerable set need not be a set of natural numbers. undo

curprev 16:5716:57, 26 February 2013‎ Addbot talk contribs‎ m 7,777 bytes −451‎ Bot: Migrating 11 interwiki links, now provided by Wikidata on d:q676835 (Report Errors) undo

curprev 05:1605:16, 6 February 2013‎ ZéroBot talk contribs‎ m 8,228 bytes +28‎ r2.7.1) (Robot: Adding ko:재귀 열거 집합 undo

curprev 04:4404:44, 16 October 2012‎ JRSpriggs talk contribs‎ 8,200 bytes −196‎ Undid revision 517955261 by 70.39.176.60 (talk) false. you are implicitly assuming that the sequence of sets is recursively enumerable which may not be true. undo

curprev 16:3216:32, 15 October 2012‎ 70.39.176.60 talk‎ 8,396 bytes +196‎ →‎Properties: This can be proved by simulating each of the algorithms in turn; eventually one of them will halt because the sets are a partition undo

19 March 2023

3 August 2022

29 July 2022

6 February 2022

29 November 2021

13 October 2021

15 June 2021

30 April 2021

29 April 2021

21 April 2021

14 April 2021

13 November 2020

12 November 2020

29 April 2020

27 August 2019

8 July 2019

23 May 2019

16 May 2019

25 October 2018

5 October 2018

22 February 2018

19 June 2017

4 April 2015

12 March 2015

24 February 2015

23 February 2015

15 November 2014

18 October 2014

4 October 2014

28 September 2014

5 September 2014

17 January 2014

16 January 2014

15 December 2013

30 November 2013

10 March 2013

9 March 2013

26 February 2013

6 February 2013

16 October 2012

15 October 2012