咨询与建议

限定检索结果

文献类型

  • 836 篇 期刊文献
  • 438 篇 会议
  • 86 册 图书
  • 1 篇 学位论文

馆藏范围

  • 1,351 篇 电子文献
  • 10 种 纸本馆藏

日期分布

学科分类号

  • 780 篇 理学
    • 693 篇 数学
    • 57 篇 物理学
    • 43 篇 统计学(可授理学、...
    • 20 篇 系统科学
    • 14 篇 科学技术史(分学科...
    • 13 篇 生物学
    • 11 篇 化学
  • 667 篇 工学
    • 536 篇 计算机科学与技术...
    • 252 篇 软件工程
    • 65 篇 电气工程
    • 53 篇 控制科学与工程
    • 22 篇 电子科学与技术(可...
    • 22 篇 信息与通信工程
    • 12 篇 力学(可授工学、理...
    • 10 篇 机械工程
    • 9 篇 化学工程与技术
    • 8 篇 动力工程及工程热...
    • 6 篇 材料科学与工程(可...
    • 6 篇 建筑学
  • 77 篇 管理学
    • 47 篇 管理科学与工程(可...
    • 24 篇 图书情报与档案管...
    • 6 篇 工商管理
    • 6 篇 公共管理
  • 29 篇 经济学
    • 18 篇 理论经济学
    • 14 篇 应用经济学
  • 24 篇 哲学
    • 20 篇 哲学
  • 12 篇 医学
    • 6 篇 基础医学(可授医学...
    • 6 篇 临床医学
  • 11 篇 法学
    • 11 篇 社会学
  • 8 篇 教育学
    • 5 篇 心理学(可授教育学...
  • 8 篇 农学
  • 6 篇 文学
  • 4 篇 艺术学
  • 1 篇 历史学

主题

  • 1,361 篇 recursive functi...
  • 187 篇 mathematical the...
  • 119 篇 logical theorems
  • 92 篇 recursion
  • 80 篇 algorithms
  • 75 篇 integers
  • 62 篇 recursively enum...
  • 60 篇 natural numbers
  • 57 篇 nasa technical r...
  • 57 篇 (ntrs)
  • 51 篇 degree of unsolv...
  • 46 篇 arithmetic
  • 42 篇 mathematical ind...
  • 34 篇 polynomials
  • 31 篇 recursion theory
  • 31 篇 approximation
  • 31 篇 algebra
  • 27 篇 induction assump...
  • 26 篇 equivalence rela...
  • 23 篇 oracles

机构

  • 7 篇 natl univ singap...
  • 6 篇 univ maryland de...
  • 5 篇 inria
  • 5 篇 univ wisconsin d...
  • 5 篇 univ munster ins...
  • 4 篇 univ kaiserslaut...
  • 4 篇 school of comput...
  • 4 篇 univ calif san d...
  • 4 篇 massachusetts in...
  • 4 篇 rutgers state un...
  • 4 篇 università degli...
  • 3 篇 university of ca...
  • 3 篇 ohio state univ ...
  • 3 篇 mit cambridge ma...
  • 3 篇 institute of mat...
  • 3 篇 univ edinburgh e...
  • 3 篇 univ chicago il ...
  • 3 篇 department of co...
  • 3 篇 univ calif berke...
  • 3 篇 natl univ singap...

作者

  • 11 篇 remmel jb
  • 9 篇 stephan frank
  • 8 篇 jain s
  • 7 篇 jockusch cg
  • 6 篇 zeugmann thomas
  • 6 篇 roversi luca
  • 6 篇 dipaola ra
  • 6 篇 dekker jce
  • 6 篇 jain sanjay
  • 6 篇 wiehagen r
  • 6 篇 kummer m
  • 6 篇 stephan f
  • 5 篇 slaman ta
  • 5 篇 kutrib martin
  • 5 篇 nipkow tobias
  • 5 篇 herrmann e
  • 5 篇 hu zhenjiang
  • 5 篇 downey rg
  • 5 篇 owings jc
  • 5 篇 byerly re

语言

  • 1,303 篇 英文
  • 43 篇 其他
  • 8 篇 法文
  • 3 篇 中文
  • 2 篇 俄文
  • 1 篇 德文
  • 1 篇 日文
检索条件"主题词=Recursive functions"
1361 条 记 录,以下是61-70 订阅
排序:
Typing Total recursive functions in Coq  8th
收藏 引用
8th International Conference on Interactive Theorem Proving (ITP)
作者: Larchey-Wendling, Dominique LORIA CNRS Nancy France
We present a (relatively) short mechanized proof that Coq types any recursive function which is provably total in Coq. The well-founded (and terminating) induction scheme, which is the foundation of Coq recursion, is ... 详细信息
来源: 评论
Regression Verification for Unbalanced recursive functions  21st
Regression Verification for Unbalanced Recursive Functions
收藏 引用
21st International Symposium on Formal Methods (FM)
作者: Strichman, Ofer Veitsman, Maor Informat Syst Engn IE Techn Haifa Israel
We address the problem of proving the equivalence of two recursive functions that have different base-cases and/or are not in lockstep. None of the existing software equivalence checkers (like REVE, RVT, SYMDIFF), or ... 详细信息
来源: 评论
UNIONS OF IDENTIFIABLE CLASSES OF TOTAL recursive functions  3rd
UNIONS OF IDENTIFIABLE CLASSES OF TOTAL RECURSIVE FUNCTIONS
收藏 引用
INTERNATIONAL WORKSHOP ON ANALOGICAL AND INDUCTIVE INFERENCE ( AII 92 )
作者: APSITIS, K FREIVALDS, R KRIKIS, M SIMANOVSKIS, R SMOTROVS, J Institute of Mathematics and Computer Science University of Latvia Raiṇa bulvāris 29 Riga Latvia Computer Science Department Yale University New Haven 06520 CT United States
*** [Bar74] has proved that there are classes of total recursive functions which are EX-identifiable but their union is not. We prove that there are no 3 classes U1, U2, U3 such that U1∪U2,U1∪U3 and U2∪U3 would be ... 详细信息
来源: 评论
Closedness properties in team learning of recursive functions  3rd
Closedness properties in team learning of recursive function...
收藏 引用
3rd European Conference on Computational Learning Theory, EuroCOLT 1997
作者: Smotrovs, Juris Institute of Mathematics and Computer Science University of Latvia Raina bulv. 29 RīgaLV-1459 Latvia
This paper investigates closedness properties in relation with team learning of total recursive functions. One of the first problems solved for any new identification types is the following: "Does the identifiabi... 详细信息
来源: 评论
Automatic Parallelization of recursive functions Using Quantifier Elimination  10
Automatic Parallelization of Recursive Functions Using Quant...
收藏 引用
10th International Symposium on Functional and Logic Programming
作者: Morihata, Akimasa Matsuzaki, Kiminori Univ Tokyo JSPS res fellow Tokyo 1138654 Japan Kochi Univ Technol Kochi Japan
Although the recent popularity of parallel-computing environments has called for parallel programs, it is difficult for nonspecialists to develop those that are efficient. What is required are parallelization methods ... 详细信息
来源: 评论
On the intrinsic complexity of learning recursive functions  99
On the intrinsic complexity of learning recursive functions
收藏 引用
Proceedings of the 1999 12th Annual Conference on Computational Learning Theory (COLT'99)
作者: Kinber, Efim Papazian, Christophe Smith, Carl Wiehagen, Rolf Sacred Heart Univ Fairfield CT United States
The intrinsic complexity of learning compares the difficulty of learning classes of objects by using some reducibility notion. For several types of learning recursive functions (learning in the limit, learning with a ... 详细信息
来源: 评论
T-Rex: Termination of recursive functions Using Lexicographic Linear Combinations  51
T-Rex: Termination of Recursive Functions Using Lexicographi...
收藏 引用
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024
作者: Giles, Raphael Douglas Jackson, Vincent Rizkallah, Christine The University of Melbourne Australia
We introduce a powerful termination algorithm for structurally recursive functions that improves on the core ideas behind lexicographic termination algorithms for functional programs. The algorithm generates linear-le... 详细信息
来源: 评论
Loop programs and classes of primitive recursive functions  7th
收藏 引用
7th Symposium on Mathematical Foundations of Computer Science, MFCS 1978
作者: Goetze, Bernhard Nehrlich, Werner Sektion Mathematik Friedrich-Schiller-Universität Jena JenaDDR - 69 Germany
A refinement of the structural complexity measure depth of nesting in loop programs leads to a new characterization of Cleave's ω2-hierarchy. This characterization allows to discover new properties (for instance ... 详细信息
来源: 评论
Dynamic optimization of covered tail recursive functions in applicative languages  86
Dynamic optimization of covered tail recursive functions in ...
收藏 引用
1986 ACM 14th Annual Conference on Computer Science, CSC 1986
作者: Felgentreu, K.-U. Lippe, W.-M. University of Munster Germany
Within the last years, the interest in efficient implementations of high level interpreter-based applicative languages has increased considerably, both in the areas of software engineering and artificial intelligence.... 详细信息
来源: 评论
Intrinsic Complexity of recursive functions on Natural Numbers with Standard Order  39
Intrinsic Complexity of Recursive Functions on Natural Numbe...
收藏 引用
39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022
作者: Bazhenov, Nikolay Kalociński, Dariusz Wroclawski, Michal Sobolev Institute of Mathematics Novosibirsk Russia Institute of Computer Science Polish Academy of Sciences Warsaw Poland Faculty of Philosophy University of Warsaw Poland
The intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum – the set of Turing degrees of images of the relation in all computable isomorphic copies of tha... 详细信息
来源: 评论