000			02064nam a22004455i 4500
001			978-3-642-11072-6
003			DE-He213
005			20140220083742.0
007			cr nn 008mamaa
008			110616s2011 gw | s |||| 0|eng d
020			_a9783642110726 _9978-3-642-11072-6
024	7		_a10.1007/978-3-642-11072-6 _2doi
050		4	_aQA8.9-10.3
072		7	_aPBC _2bicssc
072		7	_aPBCD _2bicssc
072		7	_aMAT018000 _2bisacsh
082	0	4	_a511.3 _223
100	1		_aLolli, G. _eeditor.
245	1	0	_aRecursion Theory and Computational Complexity _h[electronic resource] / _cedited by G. Lolli.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2011.
300			_a236p. 6 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aC.I.M.E. Summer Schools ; _v79
505	0		_aS. Homer: Admissible recursion theory -- B.E. Jacobs: Computational complexity and recursion theory -- D. Normann: A survey of set recursion -- G.E. Sacks: Priority arguments in Higgler recursion -- R.I. Soare: Construction in the recursively enumerable degrees -- W. Maass: Recursively invariant recursion theory.
520			_aS. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the recursively enumerable degrees.- W. Maass: Recursively invariant recursion theory.
650		0	_aMathematics.
650		0	_aLogic, Symbolic and mathematical.
650	1	4	_aMathematics.
650	2	4	_aMathematical Logic and Foundations.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642110719
830		0	_aC.I.M.E. Summer Schools ; _v79
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-11072-6
912			_aZDB-2-SMA
999			_c106797 _d106797