Home  Mathematical_Logic  Turing Degree Structures 
Page 1 151 of 51 1 
1. Local Definitions In Degree Structures The Turing Jump Local definitions in degree structures the Turing jump, hyperdegrees and beyond. Richard A. Shore. Source Bull. Symbolic Logic Volume 13, Issue 2 (2007), http://projecteuclid.org/handle/euclid.bsl/1185803806  

2. JSTOR Defining The Turing Jump The study of definability in degree structures, and in the lattice of r.e. sets, has long been a central topic in computability theory. For the Turing http://links.jstor.org/sici?sici=10798986(200103)7:1<73:DTTJ>2.0.CO;2C 
3. Turing Degrees Of Isomorphism Types Of Algebraic Objects  Calvert Et Al. 75 (2 The Turing degree spectrum of a countable structure A We show that there are structures with isomorphism types of arbitrary Turing degrees in each of http://jlms.oxfordjournals.org/cgi/content/abstract/75/2/273  

4. Research And Publications Abstract Slaman and Wehner have constructed structures which distinguish the computable Turing degree 0 from the noncomputable degrees, in the sense that http://qcpages.qc.cuny.edu/~rmiller/research.html  

5. Undecidability Results For Low Complexity Degree Structures Undecidability Results For Low Complexity degree structures degrees with respect to polynomial time Turing and manyone reducibility is undecidable. http://portal.acm.org/citation.cfm?id=792314 
6. 1. Computability And Randomness Higher Randomness Notions And Global properties of degree structures. In the Scope of Logic, The Pi3theory of the enumerable Turing degrees is undecidable (with S. Lempp and T. http://www.cs.auckland.ac.nz/~nies/onlinepapers.html  

7. Steffen Lempp's Home Page algebraic structures of, and decidability of fragments of theories of, degree structures (esp. the c.e. Turing degrees, the d.c.e. and nc.e. Turing degrees http://www.math.wisc.edu/~lempp/main.html 
8. EULER Record Details Subject, Turing degree structures. MSC, 03D28. Type, Text.Article. Record Source, Zentralblatt MATH 0958.03029. Document Delivery, Online Ordering via http://www.emis.de/projects/EULER/detail?ide=1999shordefiturijump&matchno=5&matc 
9. Conference On Logic, Computability And Randomness This talk will primarily be an exposition of the general approaches to proving that the theories of various Turing degree structures are undecidable or even http://www.dc.uba.ar/people/logic2007/  

10. 03Dxx 03D28, Other Turing degree structures. 03D30, Other degrees and reducibilities. 03D35, Undecidability and degrees of sets of sentences http://www.impan.gov.pl/MSC2000/03Dxx.html  

11. MSC 2000 : CC = Other 03D28 Other Turing degree structures Nouveau code MSC 2000 17C50; 17C50 Jordan structures associated with other structures See also 16W10 http://wwwmathdoc.ujfgrenoble.fr/cgibin/msc2000.py?CC=other&L=fr 
12. List KWIC DDC22 510 And MSC+ZDM EN Lexical Connection turbulent flows control of 76F70 turbulent transport, mixing 76F25 Turing degree structures other 03D28 Turing machines and related notions 03D10 http://www.math.unipd.it/~biblio/kwic/msccdd/dml2_11_62.htm  

13. Program On Computation Prospects Of Infinity  IMS We prove that the degree structures of the d.c.e. and the 3c.e. Turing degrees are not elementarily equivalent, thus refuting a conjecture of Downey. http://www.ims.nus.edu.sg/Programs/infinity/abstracts.htm  

14. List KWIC DDC And MSC Lexical Connection structures ordered 06Fxx structures other finite incidence 51E30 structures other Turing degree 03D28 structures probability theory on algebraic and http://www.mi.imati.cnr.it/~alberto/dml_11_50.htm  

15. B.Sc. Honours  Philosophy  School Of Philosophy And Religious Studies  Univer Not long after that, the work of Turing and others opened up logical and best be served by the existing B.Sc., B.A., or B.A.(Hons) degree structures. http://www.phil.canterbury.ac.nz/degrees/phil_bschons.shtml  

16. Recent PhDTheses In Logic Continuity in degree structures. University of Leeds, 2001. Supervisor S. Barry Cooper. Splittings and Nonsplittings in the Turing degrees. http://www.cs.bham.ac.uk/~exr/blc/PhDThesis.html  

17. Turing Degree  Wikipedia, The Free Encyclopedia 5 Structure of the r.e. Turing degrees; 6 Post s problem and the A great deal of research has been conducted into the structure of the Turing degrees. http://en.wikipedia.org/wiki/Turing_degree  

18. [math/0507128] Turing Degrees Of Isomorphism Types Of Algebraic Objects The Turing degree spectrum of a countable structure $\mathcal{A}$ is the set of all Turing degrees of isomorphic copies of $\mathcal{A}$. http://arxiv.org/abs/math/0507128  

19. Sarah Pingrey  George Washington University Let A be a computable structure and R be an additional relation on A. The Turing degree spectrum of R on A is the set of all Turing degrees of the images of http://home.gwu.edu/~spingrey/  

20. Proceedings Of The American Mathematical Society Abstract For a countable structure $ \mathcal{A}$ , the (Turing) degree spectrum of $ \mathcal{A}$ is the set of all Turing degrees of its isomorphic http://www.ams.org/proc/200713510/S0002993907088454/home.html  

21. IngentaConnect Turing Degrees Of Hypersimple Relations On Computable Structures Turing degrees of hypersimple relations on computable structures. Author Harizanov V.S.. Source Annals of Pure and Applied Logic, Volume 121, Number 2, http://www.ingentaconnect.com/content/els/01680072/2003/00000121/00000002/art001  

22. Cornell Math  Antonio Montalban First we work with the Turing degree structure, proving some embeddablity and decidability results. To cite a few we show that every countable upper http://www.math.cornell.edu/People/PhD/2005Aug/montalban.html  

23. [FOM] Natural R.e. Degrees PRINCIPAL FINDINGS First, let R_T be the set of r.e. Turing degrees, i.e., natural degrees look like in a degree structure, P_w, which is slightly http://cs.nyu.edu/pipermail/fom/2005February/008809.html  

24. Logic  Department Of Mathematics  University Of Notre Dame Computability theory concerns computability and complexity, often measured by Turing degree. A set is computable if there is a program for computing its http://www.nd.edu/~mathwww/research/logic.shtml  

25. Liang Yu: Preprints We show that there exists no Turing degree which is low for 1genericity and all of WOne approach to understanding the fine structure of initial segment http://math.nju.edu.cn/~yuliang/preprint.html  

26. The Value Of A College Degree  Computer Science@Everything2.com However, the framework of ideas is without structure and quickly crumbles . It is the tape of the Turing machine that is n in the big O. Anything that http://everything2.com/index.pl?node_id=947621 
27. DBLP: Valentina S. Harizanov 11 EE, Valentina S. Harizanov Turing degrees of hypersimple relations on computable structures. Ann. Pure Appl. Logic 121(23) 209226 (2003) http://www.informatik.unitrier.de/~ley/db/indices/atree/h/Harizanov:Valentina_  

28. Department Of Computer Science their algebraic structure, the degree of information they encode (Turing degree), their automorphisms, and their computational complexity properties. http://www.cs.uchicago.edu/research/interests  

29. Scientific Commons Yue Yang We show that the structure of recursively enumerable degrees is not a A computably enumerable (c.e.) Turing degree is a diamond base if and only if it http://en.scientificcommons.org/yue_yang  

30. Math: Faculty And Research: Mieczyslaw Dabkowski of determining the full threedimensional structure of recombination systems. of 3manifold groups that admit an order of arbitrary Turing degree. http://www.utdallas.edu/math/faculty/dabkowski.html  

31. Artificial Consciousness However, I do think McGath overstates the jurisdiction of Turing s ideas. between the degree of complexity of the physical support structure and the http://folk.uio.no/thomas/po/artificialconsciousness.html  

32. NUI Maynooth > Department Of Computer Science > We present a number of timeefficient small universal Turing ma chines. PBL into a computer science and software engineering degree structure. http://www.cs.nuim.ie/research/rptcontent.php?repid=11 
33. ON $tt$DEGREES OF RECURSIVELY ENUMERABLE TURING DEGREES DEGREES OF RECURSIVELY ENUMERABLE Turing DEGREES. G N Kobzev 1979 Math. Semiconductor Science and Technology, Smart Materials and structures http://www.iop.org/EJ/abstract/00255734/35/2/A02  

34. Alex M. McAllister's Home Page Perhaps the most commonly used formalization is that of a Turing machine, I have also studied the degreetheoretic structure of the families of sets http://web.centre.edu/alexmcal/  

35. New Zealand Mathematical Societu Newsletter Number 91, August 2004 At that time the goal was to show that there was a MartinPourEl theory of every Turing degree but Rod showed this was impossible. http://ifs.massey.ac.nz/mathnews/NZMS91/news91a.shtml  

36. ÃÃ®Â°ÂºÃÃºÂ¡ÂªÂ¡ÂªÃÃÂ¹ÃºÂ¿ÃÃÂ§ÃÂºÃÃÂ¼Ã¾ÃÃÂ¾Â¿ÃÃ¹Â¼ÃÃÃ£Â»ÃºÃÃÂ¼Ã¾ Translate this page structures and hierarchies of the Turing and the enumeration degrees, elementary differences among structures of the Turing degrees, enumeration operators http://daoshi.kaoyantj.com/2006/02/18/5F570A1866348923.html  

37. Computability Theory The ordering of the Turing degrees (and also of the enumeration degrees) is a very complex structure, requiring highly sophisticated and technically http://www.maths.leeds.ac.uk/~pmt6sbc/research.html  

38. Dr Benedikt Loewe: Recursion Theory (1st Semester 2003/2004) Structure of the 1degrees and mdegrees. Myhill s Isomorphism Theorem. The uppersemilattice of Turing Degrees. The uppersemilattice of r.e. degrees. http://staff.science.uva.nl/~bloewe/2003IRT.html  

39. Book Computability Theory, Maths For Engineers, Lavoisier Publishers Recent work in computability theory has focused on Turing definability and Degrees,and the Natural Embedding of the Turing Degrees The Structure of De http://www.lavoisier.fr/notice/gb402380.html  

40. Mathematische Logik Und Theoretische Informatik The structure of Exdegrees is coarser than that of the Turing degrees. Only very restricted learning models like finite learning (Fin) generate the same http://www.math.uniheidelberg.de/logic/abstracts.html  

41. Logic Colloquium 2006 One of the main goals of computability theory is to understand the shape of the structure of the Turing degrees. Two common ways of studying this is by http://www.cs.ru.nl/lc2006/invited.html  

Page 1 151 of 51 1 