Jump to content

英文维基 | 中文维基 | 日文维基 | 草榴社区

Blum axioms: Revision history


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

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

21 September 2023

  • curprev 03:4103:41, 21 September 2023 GraziePrego talk contribs 2,822 bytes +64 Adding local short description: "Axioms in computational complexity theory", overriding Wikidata description "axioms for complexity measure on computable functions: for a Gödel numbering φᵢ of computable functions and a computable function Φ on ℕ valued in the computable functions, ① the domain of φᵢ and Φᵢ coincide; ② the set {(i,x,t)|Φᵢ(x)=t} is recursive" undo Tag: Shortdesc helper

12 July 2023

9 August 2021

9 July 2020

  • curprev 14:2914:29, 9 July 2020 147.229.196.135 talk 2,713 bytes −1,087 Notes: Removed incorrect and misleading statements: "There is an algorithm which, on input (M, x, n) decides if Φ(M, x) = n" -- such algorithm cannot exist, for it would solve the halting problem. "If M exceeds n steps, it can halt and reject, so there is no need to determine if M halts on x." -- the author of this statement is quite clearly not familiar with Blum axioms. undo Tag: section blanking

29 April 2020

19 April 2018

10 March 2017

28 August 2015

24 February 2015

24 January 2014

18 January 2014

14 March 2013

5 July 2012

21 March 2012

12 December 2011

13 October 2011

22 September 2009

11 March 2009

22 January 2009

3 January 2009

16 August 2008

25 July 2008

8 October 2007

4 September 2007

1 September 2007

15 July 2007

28 April 2007

11 December 2006

10 December 2006

8 December 2006

14 June 2006

12 June 2006

9 February 2006

28 December 2005

16 December 2005

25 October 2005

2 October 2005

25 September 2005

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)