id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
cbi-37	Holloway, Eric	The Logical Possibility of Halting Oracles	2018	1	.pdf	application/pdf	668	36	63	Since the search per- forms an exact match with the input finite Turing machine and the retrieved finite Turing machine, then the match can be encoded as a finite Turing machine as well. The search procedure can be encoded with a finite Tur- ing machine that counts upwards incrementally, and can call out to an external index to retrieve the finite Turing machine definition and halting status.	cache/cbi-37.pdf	txt/cbi-37.txt