scispace - formally typeset
Search or ask a question
Topic

Computability

About: Computability is a research topic. Over the lifetime, 2829 publications have been published within this topic receiving 85162 citations.


Papers
More filters
Proceedings ArticleDOI
08 Nov 1999
TL;DR: Improved strategies in DLM-99-SAT (Discrete Lagrange Multipliers 1999, Satisfiability) to escape from traps and to select proper parameter sets to use when applied to solve some difficult but satisfiable SAT problems are presented.
Abstract: Presents improved strategies in DLM-99-SAT (Discrete Lagrange Multipliers 1999, Satisfiability) to escape from traps and to select proper parameter sets to use when applied to solve some difficult but satisfiable SAT problems. One of the main issues in DLM-99-SAT is that it has a large number of tunable parameters, making it difficult to determine the best parameters to use when given a new instance. To this end, we propose a set of performance metrics and a set of rules using these metrics that determine at run-time the best parameters to use for a specific instance. Our experimental results show that these rules are able to select the most suitable parameter set for each instance with very little overhead. Finally, we verify the performance of DLM-99-SAT by solving some benchmarks in SATLIB (SATisfiability problems LIBrary) and some of the most difficult but satisfiable DIMACS SAT benchmark problems, including par32-1-c to par32-4-c and hanoi4-simple.

13 citations

Journal ArticleDOI
01 Jan 2015
TL;DR: The notion of intrinsic asymptotic density was introduced in this article, with rich relations to both randomness and classical computability theory, and it has been used to define intrinsic density 0 as a new immunity property.
Abstract: In 2012, inspired by developments in group theory and complexity, Jockusch and Schupp introduced generic com- putability, capturing the idea that an algorithm might work correctly except for a vanishing fraction of cases. However, we observe that their definition of a negligible set is not computably invariant (and thus not well-defined on the 1-degrees), resulting in some failures of intuition and a break with standard expectations in computability theory. To strengthen their approach, we introduce a new notion of intrinsic asymptotic density, with rich relations to both randomness and classical computability theory. We then apply these ideas to propose alternative foundations for further development in (intrinsic) generic computability. Toward these goals, we classify intrinsic density 0 as a new immunity property, specifying its position in the standard hierar- chy from immune to cohesive for both general and � 0 sets, and identify intrinsic density 1 as the stochasticity corresponding to permutation randomness. We also prove that Rice's Theorem extends to all intrinsic variations of generic computability, demon- strating in particular that no such notion considers ∅ � to be "computable".

13 citations

Proceedings Article
05 Aug 2014
TL;DR: This paper devote this paper to the definability issue of several classes of frames by means of the language of PRSPDL and to the computabilityissue ofPRSPDL-validity for various fragments of the PRSP DL-language and for various classes of PR SPDL-frames.
Abstract: PRSPDL is a variant of PDL with parallel composition. In the Kripke models in which PRSPDL-formulas are evaluated, states have an internal structure. We devote this paper to the definability issue of several classes of frames by means of the language of PRSPDL and to the computability issue of PRSPDL-validity for various fragments of the PRSPDL-language and for various classes of PRSPDL-frames.

13 citations

Journal ArticleDOI
TL;DR: This paper presents a formal syntax and semantic of the transition P systems capturing the synchronized work of P systems, and the nondeterministic and maximally parallel manner in which the rules of these systems can be applied.
Abstract: In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: transition P systems as they were given in [3], addressed with completely different techniques than in [1] and [2]. For this, we present a formal syntax and semantic of the transition P systems capturing the synchronized work of P systems, and the nondeterministic and maximally parallel manner in which the rules of these systems can be applied.

13 citations

Journal ArticleDOI
TL;DR: This paper presents the first structural property of (m,n)-recognizable languages which is valid for all 1 ≤ m ≤ n and for all alphabets and Kinber's result for unary alphABets becomes a corollary.

13 citations


Network Information
Related Topics (5)
Finite-state machine
15.1K papers, 292.9K citations
86% related
Mathematical proof
13.8K papers, 374.4K citations
86% related
Model checking
16.9K papers, 451.6K citations
85% related
Time complexity
36K papers, 879.5K citations
85% related
Concurrency
13K papers, 347.1K citations
85% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202344
2022119
202189
202098
2019111
201897