David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Symbolic Logic 73 (2):656 - 673 (2008)
In this paper we study generic complexity of undecidable problems. It turns out that some classical undecidable problems are, in fact, strongly undecidable, i.e., they are undecidable on every strongly generic subset of inputs. For instance, the classical Halting Problem is strongly undecidable. Moreover, we prove and analog of the Rice theorem for strongly undecidable problems, which provides plenty of examples of strongly undecidable problems. Then we show that there are natural super-undecidable problems. i.e., problem which are undecidable on every generic (not only strongly generic) subset of inputs. In particular, there are finitely presented semigroups with super-undecidable word problem. To construct strongly- and super-undecidable problems we introducea method of generic amplification (an analog of the amplification in complexity theory). Finally, we construct absolutely undecidable problems, which stay undecidable on every non-negligible set of inputs. Their construction rests on generic immune sets
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Stephen A. Fenner (1994). Almost Weakly 2-Generic Sets. Journal of Symbolic Logic 59 (3):868-887.
Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt & Joseph S. Miller (2006). Every 1-Generic Computes a Properly 1-Generic. Journal of Symbolic Logic 71 (4):1385 - 1393.
Bruno Scarpellini (2003). Comments on `Two Undecidable Problems of Analysis'. Minds and Machines 13 (1):79-85.
Juan Pascual-Leone (1998). To Appraise Developmental Difficulty or Mental Demand, Relational Complexity is Not Enough. Behavioral and Brain Sciences 21 (6):843-844.
Adam J. Grove, Joseph Y. Halpern & Daphne Koller (1996). Asymptotic Conditional Probabilities: The Non-Unary Case. Journal of Symbolic Logic 61 (1):250-276.
Ron Sigal (1989). Undecidable Complexity Statements in Eαs-Arithmetic. Journal of Symbolic Logic 54 (2):415 - 427.
Aldo Ursini (1985). Decision Problems for Classes of Diagonalizable Algebras. Studia Logica 44 (1):87 - 89.
Panu Raatikainen (2003). Some Strongly Undecidable Natural Arithmetical Problems, with an Application to Intuitionistic Theories. Journal of Symbolic Logic 68 (1):262-266.
Christine Ann Haught (1986). The Degrees Below a 1-Generic Degree $. Journal of Symbolic Logic 51 (3):770 - 777.
Ernest Sosa (1992). Generic Reliabilism and Virtue Epistemology. Philosophical Issues 2:79-92.
Bruno Scarpellini (2003). Two Undecidable Problems of Analysis. Minds and Machines 13 (1):49-77.
David Gabelaia, Agi Kurucz, Frank Wolter & Michael Zakharyaschev (2005). Products of 'Transitive' Modal Logics. Journal of Symbolic Logic 70 (3):993-1021.
Toshio Suzuki (2000). Complexity of the -Query Tautologies in the Presence of a Generic Oracle. Notre Dame Journal of Formal Logic 41 (2):142-151.
Added to index2010-08-24
Total downloads9 ( #153,019 of 1,096,898 )
Recent downloads (6 months)2 ( #164,383 of 1,096,898 )
How can I increase my downloads?