List of Busy Beaver Papers - Revision history

Sligocki: Link Tibor Radó

2025-12-04T21:35:30Z

Link Tibor Radó

← Older revision		Revision as of 21:35, 4 December 2025
Line 8:		Line 8:
	\|-		\|-
	\|On Non-Computable Functions		\|On Non-Computable Functions
	\|Tibor Radó		\|[[Tibor Radó]]
	\|May 1962		\|May 1962
	\|{{doi\|10.1002/j.1538-7305.1962.tb00480.x}}		\|{{doi\|10.1002/j.1538-7305.1962.tb00480.x}}
Line 14:		Line 14:
	\|-		\|-
	\|On a simple source for non-computable functions		\|On a simple source for non-computable functions
	\|Tibor Radó		\|[[Tibor Radó]]
	\|1963		\|1963
	\|		\|
Line 27:		Line 27:
	\|Computer Studies of Turing Machine Problems		\|Computer Studies of Turing Machine Problems
	\|[[Shen Lin]]		\|[[Shen Lin]]
	Tibor Radó		[[Tibor Radó]]
	\|1 April 1965		\|1 April 1965
	\|{{doi\|10.1145/321264.321270}}		\|{{doi\|10.1145/321264.321270}}

2025-12-04T17:40:43Z

lynn 1972

← Older revision		Revision as of 17:40, 4 December 2025
Line 43:		Line 43:
	\|{{doi\|10.1109/PGEC.1966.264572}}		\|{{doi\|10.1109/PGEC.1966.264572}}
	\|		\|
			\|-
			\|New results for Rado's sigma function for binary Turing machines
			\|Donald S. Lynn
			\|31 August 1972
			\|{{doi\|10.1109/TC.1972.5009047}}
			\|[https://docs.bbchallenge.org/papers/Lynn1972.pdf PDF]
	\|-		\|-
	\|The solution to Rado's busy beaver game is now decided for k = 4. Preliminary report. (Abstract)		\|The solution to Rado's busy beaver game is now decided for k = 4. Preliminary report. (Abstract)

2025-12-04T17:39:46Z

Link Shen Lin

← Older revision		Revision as of 17:39, 4 December 2025
Line 26:		Line 26:
	\|-		\|-
	\|Computer Studies of Turing Machine Problems		\|Computer Studies of Turing Machine Problems
	\|Shen Lin		\|[[Shen Lin]]
	Tibor Radó		Tibor Radó
	\|1 April 1965		\|1 April 1965

2025-12-04T16:14:14Z

Add paper, change other date

← Older revision		Revision as of 16:14, 4 December 2025
Line 23:		Line 23:
	\|11-13 November 1964		\|11-13 November 1964
	\|{{doi\|10.1109/SWCT.1964.3}}		\|{{doi\|10.1109/SWCT.1964.3}}
			\|
			\|-
			\|Computer Studies of Turing Machine Problems
			\|Shen Lin
			Tibor Radó
			\|1 April 1965
			\|{{doi\|10.1145/321264.321270}}
	\|		\|
	\|-		\|-
	\|Solutions of restricted cases of the halting problem applied to the determination of particular values of a non-computable function		\|Solutions of restricted cases of the halting problem applied to the determination of particular values of a non-computable function
	\|Allen H. Brady		\|Allen H. Brady
	\|~~10 December 1964~~		\|June 1965
	\|		\|
	\|[http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/zk51vk21c Thesis Archive]		\|[http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/zk51vk21c Thesis Archive]

2025-12-04T15:29:42Z

Normalize date order

← Older revision		Revision as of 15:29, 4 December 2025
Line 21:		Line 21:
	\|A Lower Bound on Rado's Sigma-Function for Binary Turing Machines		\|A Lower Bound on Rado's Sigma-Function for Binary Turing Machines
	\|Milton W. Green		\|Milton W. Green
	\|~~1964 November~~ 11-13		\|11-13 November 1964
	\|{{doi\|10.1109/SWCT.1964.3}}		\|{{doi\|10.1109/SWCT.1964.3}}
	\|		\|

2025-12-04T15:29:01Z

Use full Radó name and shorten Download column width so more things fit.

← Older revision		Revision as of 15:29, 4 December 2025
Line 8:		Line 8:
	\|-		\|-
	\|On Non-Computable Functions		\|On Non-Computable Functions
	\|~~T. Rado~~		\|Tibor Radó
	\|May 1962		\|May 1962
	\|{{doi\|10.1002/j.1538-7305.1962.tb00480.x}}		\|{{doi\|10.1002/j.1538-7305.1962.tb00480.x}}
Line 14:		Line 14:
	\|-		\|-
	\|On a simple source for non-computable functions		\|On a simple source for non-computable functions
	\|~~T. Rado~~		\|Tibor Radó
	\|1963		\|1963
	\|		\|
	\|https://docs.bbchallenge.org/papers/Rado1963.pdf		\|[https://docs.bbchallenge.org/papers/Rado1963.pdf PDF]
	\|-		\|-
	\|A Lower Bound on Rado's Sigma-Function for Binary Turing Machines		\|A Lower Bound on Rado's Sigma-Function for Binary Turing Machines
Line 29:		Line 29:
	\|10 December 1964		\|10 December 1964
	\|		\|
	\|http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/zk51vk21c		\|[http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/zk51vk21c Thesis Archive]
	\|-		\|-
	\|The Conjectured Highest Scoring Machines for Rado's Σ(k) for the Value k = 4		\|The Conjectured Highest Scoring Machines for Rado's Σ(k) for the Value k = 4
Line 41:		Line 41:
	\|January 1975		\|January 1975
	\|		\|
	\|https://www.ams.org/journals/notices/197501/197501FullIssue.pdf (A-25, PDF Page 109)		\|[https://www.ams.org/journals/notices/197501/197501FullIssue.pdf PDF] (A-25, PDF Page 109)
	\|}		\|}

2025-12-04T15:24:48Z

Add doi template (and move page note up into the table.

← Older revision		Revision as of 15:24, 4 December 2025
Line 10:		Line 10:
	\|T. Rado		\|T. Rado
	\|May 1962		\|May 1962
	\|10.1002/j.1538-7305.1962.tb00480.x		\|{{doi\|10.1002/j.1538-7305.1962.tb00480.x}}
	\|		\|
	\|-		\|-
Line 22:		Line 22:
	\|Milton W. Green		\|Milton W. Green
	\|1964 November 11-13		\|1964 November 11-13
	\|10.1109/SWCT.1964.3		\|{{doi\|10.1109/SWCT.1964.3}}
	\|		\|
	\|-		\|-
Line 34:		Line 34:
	\|Allen H. Brady		\|Allen H. Brady
	\|31 October 1966		\|31 October 1966
	\|10.1109/PGEC.1966.264572		\|{{doi\|10.1109/PGEC.1966.264572}}
	\|		\|
	\|-		\|-
Line 41:		Line 41:
	\|January 1975		\|January 1975
	\|		\|
	\|https://www.ams.org/journals/notices/197501/197501FullIssue.pdf<nowiki/>*		\|https://www.ams.org/journals/notices/197501/197501FullIssue.pdf (A-25, PDF Page 109)
	\|}*A-25, PDF Page 109.		\|}

2025-12-04T15:15:10Z

Green's paper actual title

← Older revision		Revision as of 15:15, 4 December 2025
Line 19:		Line 19:
	\|https://docs.bbchallenge.org/papers/Rado1963.pdf		\|https://docs.bbchallenge.org/papers/Rado1963.pdf
	\|-		\|-
	\|A ~~lower bound RADO~~'s ~~sigma function~~ for ~~binary turing machines~~		\|A Lower Bound on Rado's Sigma-Function for Binary Turing Machines
	\|Milton W. Green		\|Milton W. Green
	\|1964 November 11-13		\|1964 November 11-13

2025-12-04T15:11:35Z

formatting

← Older revision		Revision as of 15:11, 4 December 2025
Line 21:		Line 21:
	\|A lower bound RADO's sigma function for binary turing machines		\|A lower bound RADO's sigma function for binary turing machines
	\|Milton W. Green		\|Milton W. Green
	\|1964 November		\|1964 November 11-13
	11-13
	\|10.1109/SWCT.1964.3		\|10.1109/SWCT.1964.3
	\|		\|

2025-12-04T15:11:16Z

confirm date

← Older revision		Revision as of 15:11, 4 December 2025
Line 21:		Line 21:
	\|A lower bound RADO's sigma function for binary turing machines		\|A lower bound RADO's sigma function for binary turing machines
	\|Milton W. Green		\|Milton W. Green
	\|1964*		\|1964 November
			11-13
	\|10.1109/SWCT.1964.3		\|10.1109/SWCT.1964.3
	\|		\|
Line 41:		Line 42:
	\|January 1975		\|January 1975
	\|		\|
	\|https://www.ams.org/journals/notices/197501/197501FullIssue.pdf<nowiki/>**		\|https://www.ams.org/journals/notices/197501/197501FullIssue.pdf<nowiki/>*
	\|}		\|}*A-25, PDF Page 109.
	~~<nowiki>*</nowiki>(Possibly between November 11th and November 13th, could not locate source)~~

	<nowiki>**~~</nowiki>~~A-25, PDF Page 109.