1 |
Towards Parallel Algorithms for Abstract Dialectical Frameworks ...
|
|
|
|
BASE
|
|
Show details
|
|
4 |
A theoretical and experimental analysis of BWT variants for string collections ...
|
|
|
|
BASE
|
|
Show details
|
|
5 |
String Rearrangement Inequalities and a Total Order Between Primitive Words ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
Dynamic Suffix Array with Polylogarithmic Queries and Updates ...
|
|
|
|
BASE
|
|
Show details
|
|
7 |
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems ...
|
|
|
|
BASE
|
|
Show details
|
|
8 |
An Optimal-Time RLBWT Construction in BWT-runs Bounded Space ...
|
|
|
|
BASE
|
|
Show details
|
|
9 |
An Unsupervised Approach to Structuring and Analyzing Repetitive Semantic Structures in Free Text of Electronic Medical Records
|
|
|
|
In: Journal of Personalized Medicine; Volume 12; Issue 1; Pages: 25 (2022)
|
|
BASE
|
|
Show details
|
|
10 |
Optimal Fuzzy Controller Design for Autonomous Robot Path Tracking Using Population-Based Metaheuristics
|
|
|
|
In: Symmetry; Volume 14; Issue 2; Pages: 202 (2022)
|
|
BASE
|
|
Show details
|
|
11 |
Methods, Models and Tools for Improving the Quality of Textual Annotations
|
|
|
|
In: Modelling; Volume 3; Issue 2; Pages: 224-242 (2022)
|
|
BASE
|
|
Show details
|
|
12 |
Undecidability and Complexity for Super-Turing Models of Computation
|
|
|
|
In: Proceedings; Volume 81; Issue 1; Pages: 123 (2022)
|
|
Abstract:
It seems that intelligent complex systems will require formalisms having richer behavior than Turing machines. Very little is known about the relations (e.g., the expressiveness and/or effectiveness) between new super-Turing models of computation. The objective of this paper is an attempt to establish a hierarchy of expressiveness of super-Turing models. Truly, a new theory of undecidability and complexity for super-Turing models has to be developed. Some preliminary steps have been done in this paper by introducing a-decidable and i-decidable algorithms and U-complete, D-complete, and H-complete complexity classes that were inspired by NP-complete and PSPACE-complete classes for intractable problems. This paper should be understood as a preliminary step leading to feasible approximate solutions of Turing machine undecidable problems, in a similar way as approximate, randomized, and parallel algorithms allow for feasible solutions for intractable problems.
|
|
Keyword:
a-decidability; D-completeness; H-completeness; i-decidability; intractability; reduction techniques; super-recursive algorithms; super-Turing computation; U-completeness; undecidability
|
|
URL: https://doi.org/10.3390/proceedings2022081123
|
|
BASE
|
|
Hide details
|
|
13 |
Suffix tree-based linear algorithms for multiple prefixes, single suffix counting and listing problems ...
|
|
|
|
BASE
|
|
Show details
|
|
14 |
Reduction ratio of the IS-algorithm: worst and random cases ...
|
|
|
|
BASE
|
|
Show details
|
|
15 |
Optimal Fuzzy Controller Design for Autonomous Robot Path Tracking Using Population-Based Metaheuristics
|
|
|
|
BASE
|
|
Show details
|
|
17 |
Design and development of a lead free piezoelectric energy harvester for wideband, low frequency and low amplitude vibrations
|
|
|
|
In: Micromachines ; https://hal.archives-ouvertes.fr/hal-03549337 ; Micromachines, 2021, 12 (12), pp.1537 (2021)
|
|
BASE
|
|
Show details
|
|
18 |
Distinct signatures of subjective confidence and objective accuracy in speech prosody
|
|
|
|
In: ISSN: 0010-0277 ; EISSN: 1873-7838 ; Cognition ; https://hal.sorbonne-universite.fr/hal-03263512 ; Cognition, Elsevier, 2021, 212, pp.104661. ⟨10.1016/j.cognition.2021.104661⟩ (2021)
|
|
BASE
|
|
Show details
|
|
19 |
E.W. Dijkstra, 1959, A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, p. 269271 Version bilingue et commentée
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-03171590 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
20 |
Critical Digital Humanities: texts, code and algorithms
|
|
|
|
In: Humanités numériques dans et sur les Amériques ; https://hal.archives-ouvertes.fr/hal-03373785 ; Humanités numériques dans et sur les Amériques, Apr 2021, Avignon, France (2021)
|
|
BASE
|
|
Show details
|
|
|
|