標(biāo)題: Titlebook: Combinatorics, Computability and Logic; Proceedings of the T C. S. Calude,M. J. Dinneen,S. Sburlan Conference proceedings 2001 Springer-Ver [打印本頁] 作者: 多話 時(shí)間: 2025-3-21 17:01
書目名稱Combinatorics, Computability and Logic影響因子(影響力)
書目名稱Combinatorics, Computability and Logic影響因子(影響力)學(xué)科排名
書目名稱Combinatorics, Computability and Logic網(wǎng)絡(luò)公開度
書目名稱Combinatorics, Computability and Logic網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Combinatorics, Computability and Logic被引頻次
書目名稱Combinatorics, Computability and Logic被引頻次學(xué)科排名
書目名稱Combinatorics, Computability and Logic年度引用
書目名稱Combinatorics, Computability and Logic年度引用學(xué)科排名
書目名稱Combinatorics, Computability and Logic讀者反饋
書目名稱Combinatorics, Computability and Logic讀者反饋學(xué)科排名
作者: 失眠癥 時(shí)間: 2025-3-21 22:49 作者: 金絲雀 時(shí)間: 2025-3-22 01:45
Some Results for Some Conjectures in Addition Chainsopose a special class of addition chain called ., we conjecture that it is equivalent to .. -. and we prove that this conjecture is true for integers . ≤ 8 × 10.. Also, we prove that the Scholz and Aiello-Subbarao conjectures are true for integers . ≤ 8 × 10..作者: 接合 時(shí)間: 2025-3-22 06:26 作者: Hormones 時(shí)間: 2025-3-22 11:49 作者: 碎石 時(shí)間: 2025-3-22 16:50
https://doi.org/10.1007/978-1-4614-6409-9. → ∞..As a consequence, it is deduced that for each fixed . ≥ 1 and . ≥ 2, almost every .-connected (resp. .-strongly connected) graph or digraph with diameter . or . +1 has diameter exactly ...Some open problems and conjectures are proposed.作者: 碎石 時(shí)間: 2025-3-22 18:50 作者: Mingle 時(shí)間: 2025-3-22 22:13
Architecture and Implementationto their question proving that if . a unicycle bipartite graph, then all maximum matchings of . are uniquely restricted if and only if there is an edge e belonging to the cycle such that no maximum matching of . contains ..作者: Hemoptysis 時(shí)間: 2025-3-23 02:12
Iryna Gurevych,Robert Porzel,Rainer Malakaniversal self delimiting machine halts. The algorithmic complexity of . is strictly greater than that of ., but similar to the algorithmic complexity of ., the halting probability of an oracle machine. What makes . interesting is that it is an example of a highly random number definable without considering oracles.作者: 變化 時(shí)間: 2025-3-23 06:05 作者: CHECK 時(shí)間: 2025-3-23 12:34
A Highly Random Numberniversal self delimiting machine halts. The algorithmic complexity of . is strictly greater than that of ., but similar to the algorithmic complexity of ., the halting probability of an oracle machine. What makes . interesting is that it is an example of a highly random number definable without considering oracles.作者: Strength 時(shí)間: 2025-3-23 16:48 作者: Fresco 時(shí)間: 2025-3-23 18:52
Architecture and Implementation <1; the 1-mc real numbers are just the semi-computable real numbers and the set of all mc real numbers is contained properly in the set of weakly computable real numbers, where . is weakly computable if there are semi-computable real numbers ., . such that . = . + .. Furthermore, we show also an infinite hierarchy of mc real numbers.作者: altruism 時(shí)間: 2025-3-24 01:49 作者: Eosinophils 時(shí)間: 2025-3-24 02:41 作者: 前兆 時(shí)間: 2025-3-24 09:59
Overview: 978-1-85233-526-7978-1-4471-0717-0作者: Gum-Disease 時(shí)間: 2025-3-24 14:00
Smart-ECO Buildings towards 2020/2030and how the basic ideas and methods used in a restricted area of Logic derive from, or at least interact with, a wider mathematical and intellectual experience. I can only offer suggestions, not scholarly arguments, to those who share my interest.作者: 抵消 時(shí)間: 2025-3-24 16:27 作者: aesthetician 時(shí)間: 2025-3-24 19:38
https://doi.org/10.1007/978-3-319-06551-9 set . can be ordered with the usual set inclusion relation. We show that this ordered set is a complete lattice whenever . is a complete join-semilattice. We introduce dense sets of an Armstrong system and present some results concerning them. In particular, we characterize keys of a database relation in terms of dense sets.作者: 不透明 時(shí)間: 2025-3-25 01:12 作者: committed 時(shí)間: 2025-3-25 04:31 作者: 急性 時(shí)間: 2025-3-25 08:52 作者: Trochlea 時(shí)間: 2025-3-25 15:34
Datenschutz und Datensicherheit,rd appears in the sequence infinitely many times. “Disjunctivity” is a natural qualitative property; it is weaker, than the property of “normality” (introduced by Borel; see, for instance, [Ca94,He96]).作者: compose 時(shí)間: 2025-3-25 15:48
Smart Car Space: An Application,regarded as the subsets of {1, 2,…, .} without . consecutive elements and bitstrings in .. code a particular class of trees or compositions of an integer. In this paper we give a Gray code for .. which can be implemented in a recursive generating algorithm, and finally in a loopless generating algorithm.作者: clarify 時(shí)間: 2025-3-25 22:08 作者: 有發(fā)明天才 時(shí)間: 2025-3-26 00:14
Innovative Technological Solutions,d graph theorem, depends on Baire’s theorem about complete metric spaces, which is an indispensable tool in this area. A form of Baire’s theorem has a constructive proof [5, Theorem 1.3], but its classical equivalent,.which is used in the standard argument to prove that the above theorems have no kn作者: 白楊 時(shí)間: 2025-3-26 06:26
Smart-ECO Buildings towards 2020/2030and how the basic ideas and methods used in a restricted area of Logic derive from, or at least interact with, a wider mathematical and intellectual experience. I can only offer suggestions, not scholarly arguments, to those who share my interest.作者: epicondylitis 時(shí)間: 2025-3-26 09:07
https://doi.org/10.1007/978-1-4614-6409-9. ≥ 3 are surveyed. Since for . ≥ 4 all extremal graphs or digraphs . used to prove the lower bound of the estimation have connectivity . (.) = ., it follows that these formulas are also valid for the number of graphs or digraphs of order ., diameter equal to . ≥ 4 and connectivity . (.) = . ≥ 1 as 作者: 舊病復(fù)發(fā) 時(shí)間: 2025-3-26 16:07 作者: 陰謀小團(tuán)體 時(shí)間: 2025-3-26 20:13 作者: 敵意 時(shí)間: 2025-3-26 23:39 作者: OASIS 時(shí)間: 2025-3-27 05:05 作者: GET 時(shí)間: 2025-3-27 07:31 作者: animated 時(shí)間: 2025-3-27 10:08
Architecture and Implementatione cycle..In [1] Golumbic, Hirst and Lewenstein observed that for a tree or a graph with only odd cycles the size of its maximum uniquely restricted matching is equal to its matching number. They posed the problem of finding other graphs enjoying this equality..In this paper we give a partial answer 作者: 惰性氣體 時(shí)間: 2025-3-27 13:35 作者: hauteur 時(shí)間: 2025-3-27 19:49 作者: Apraxia 時(shí)間: 2025-3-27 22:21
Architecture and Implementatione, a later member of the sequence is always a better approximation to . in the sense that |. ? ..| ≥ . ? ..|, if . ≤ .. As a natural generalization, we call a real number . (.-mc, for short), for any real number . >0,, if there is a computable sequence (x.),.? of rational numbers which converges to 作者: 廢止 時(shí)間: 2025-3-28 03:11 作者: magenta 時(shí)間: 2025-3-28 09:36 作者: 珍奇 時(shí)間: 2025-3-28 14:13
Smart Car Space: An Application,regarded as the subsets of {1, 2,…, .} without . consecutive elements and bitstrings in .. code a particular class of trees or compositions of an integer. In this paper we give a Gray code for .. which can be implemented in a recursive generating algorithm, and finally in a loopless generating algor作者: 友好關(guān)系 時(shí)間: 2025-3-28 17:52
https://doi.org/10.1007/978-1-4471-0717-0Automat; Graph; Matching; Sim; algorithms; automata; complexity; formal language; logic; algorithm analysis a作者: FID 時(shí)間: 2025-3-28 22:01 作者: Strength 時(shí)間: 2025-3-29 00:42
Recursive Functions: An Archeological Lookand how the basic ideas and methods used in a restricted area of Logic derive from, or at least interact with, a wider mathematical and intellectual experience. I can only offer suggestions, not scholarly arguments, to those who share my interest.作者: Nerve-Block 時(shí)間: 2025-3-29 06:45
Lex Ideals of Generalized MV-Algebrasras and unital .-groups, we describe the ordered sets of prime and regular ideals of GMV-algebras induced on principal ideals, study lexicographic extensions of ideals of GMV-algebras and describe basic GMV-algebras.作者: brachial-plexus 時(shí)間: 2025-3-29 07:34 作者: liposuction 時(shí)間: 2025-3-29 11:35
On Relax-ability of Word-Order by D-grammarsn of DR-(non)projectivity. We obtain two infinite scales of classes of languages using different degrees of relaxation. The one scale contains the class of context-free languages as its first (minimal) element, the other one starts by the class of regular languages.作者: 小官 時(shí)間: 2025-3-29 19:18
On the Structure of Linear Cellular Automataesented together with their properties in the first section of the paper. We characterize linear functions which are global transition functions for certain bounded linear cellular automata. Finally, some results concerning the limit sets and a remarkable structure for isometric linear cellular automata are also included.作者: 不如樂死去 時(shí)間: 2025-3-29 23:11 作者: hedonic 時(shí)間: 2025-3-29 23:55 作者: 逗留 時(shí)間: 2025-3-30 07:01
A Loopless Generation of Bitstrings without , Consecutive Onesregarded as the subsets of {1, 2,…, .} without . consecutive elements and bitstrings in .. code a particular class of trees or compositions of an integer. In this paper we give a Gray code for .. which can be implemented in a recursive generating algorithm, and finally in a loopless generating algorithm.作者: 連鎖 時(shí)間: 2025-3-30 08:16 作者: Fulsome 時(shí)間: 2025-3-30 14:39 作者: GIDDY 時(shí)間: 2025-3-30 17:18 作者: 使饑餓 時(shí)間: 2025-3-30 23:58
Even Linear Simple Matrix Languages: Formal Language AspectsWe investigate formal language properties of even linear simple matrix languages and related language classes. More precisely, we discuss characterizations, (proper) inclusion relations, closure properties and decidability questions. In another paper [4], we showed the importance of these language classes for grammatical inference issues.作者: 辭職 時(shí)間: 2025-3-31 03:57 作者: 夾克怕包裹 時(shí)間: 2025-3-31 08:28
P-Immune Sets with Holes Lack Self-Reducibility PropertiesNo P-immune set having exponential gaps is positive-Turing self-reducible.作者: 隨意 時(shí)間: 2025-3-31 09:40 作者: Occlusion 時(shí)間: 2025-3-31 16:50
Sequentially Continuity in Constructive Mathematicsd graph theorem, depends on Baire’s theorem about complete metric spaces, which is an indispensable tool in this area. A form of Baire’s theorem has a constructive proof [5, Theorem 1.3], but its classical equivalent,.which is used in the standard argument to prove that the above theorems have no kn作者: WAIL 時(shí)間: 2025-3-31 21:09
Recursive Functions: An Archeological Lookand how the basic ideas and methods used in a restricted area of Logic derive from, or at least interact with, a wider mathematical and intellectual experience. I can only offer suggestions, not scholarly arguments, to those who share my interest.作者: Anticoagulant 時(shí)間: 2025-3-31 21:54 作者: Projection 時(shí)間: 2025-4-1 05:40
Some Results for Some Conjectures in Addition Chains0 ≤ ., . < .. The smallest length . for which an addition chain for . exists is denoted by .(.). Scholz conjectured that .(2. ? 1) ≤ . + .(.) ? 1. Aiello and Subbarao proposed a stronger conjecture which is “. ≥ 1, . 2. ? 1 . ? 1.” This paper improves Brauer’s result for the Scholz conjecture. We pr作者: MUTED 時(shí)間: 2025-4-1 07:12
A Highly Random Number define . as the probability that an arbitrary machine be circular and we prove that . is a random number that goes beyond ., the probability that a universal self delimiting machine halts. The algorithmic complexity of . is strictly greater than that of ., but similar to the algorithmic complexity 作者: vector 時(shí)間: 2025-4-1 12:12
Dini’s Theorem: A Constructive Case Studysince it fails in the recursive model. Nevertheless, a basic constructive version of the theorem is proved, as is a version in which the uniform convergence of the sequence of functions is reduced to the convergence of some subsequence of a particular sequence of real numbers. After some additional
