咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是71-80 订阅
排序:
A user's friendly syntax to define recursive functions as typed λ-terms  2nd
A user's friendly syntax to define recursive functions as ty...
收藏 引用
2nd Annual Workshop on Types for Proofs and Programs, TYPES 1994
作者: Manoury, Pascal INRIA Domaine de Voluceau Rocquencourt Le Chesnay CedexF-78t53 France
This paper discusses the problem of translating a (recursive) function definition expressed in a ML like syntax into a typed A-term. In this paper, we recall how termination proofs can be solutions of the investigated... 详细信息
来源: 评论
Probabilistic inductive inference of indices in enumerable classes of total recursive functions  2nd
Probabilistic inductive inference of indices in enumerable c...
收藏 引用
2nd International Workshop on Analogical and Inductive Inference, AII 1989
作者: Greitāne, Inguna Computing Center Latvian State University Riga Latvia
We consider identification of indices of functions in recursively enumerable classes of total recursive functions. The number of changes of the hypotheses is used as the complexity measure of the inductive inference m... 详细信息
来源: 评论
Learning summaries of recursive functions  21
Learning summaries of recursive functions
收藏 引用
21st Asia-Pacific Software Engineering Conference, APSEC 2014
作者: Chen, Yu-Fang Wang, Bow-Yaw Yang, Kai-Chun Institute of Information Science Academia Sinica Taiwan
We describe a learning-based approach for verifying recursive functions. The Boolean formula learning algorithm CDNF is used to automatically infer function summaries for recursive functions. In contrast to traditiona... 详细信息
来源: 评论
Defining recursive functions in HOL
Defining recursive functions in HOL
收藏 引用
1991 International Tutorial and Workshop on the HOL Theorem Proving System and Its Applications
作者: Ploegaerts, W. Claesen, L. De Man, H. IMEC Vzw Kapeldreef 75 LeuvenB-3001 Belgium Belgian National Fund for Scientific Research Belgium K.U.Leuven Belgium
The limited support for defining recursive functions and generating induction schemes is a major shortcoming of the HOL system. In this paper, a theory of primitive recursive functions and a tool that minimizes the pr... 详细信息
来源: 评论
Optimising recursive functions yielding multiple results in tuples in a lazy functional language  11th
Optimising recursive functions yielding multiple results in ...
收藏 引用
11th International Workshop on Implementation of Functional Languages, IFL 1999
作者: van Groningen, John H. G. University of Nijmegen Department of Computer Science Toernooiveld 1 Nijmegen6525 ED Netherlands
We discuss a new optimisation for recursive functions yielding multiple results in tuples for lazy functional languages, like Clean and Haskell. This optimisation improves the execution time of such functions and also... 详细信息
来源: 评论
Approximate Degree Composition for recursive functions  27
Approximate Degree Composition for Recursive Functions
收藏 引用
27th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2024 and the 28th International Conference on Randomization and Computation, RANDOM 2024
作者: Chakraborty, Sourav Kayal, Chandrima Mittal, Rajat Paraashar, Manaswi Saurabh, Nitin Indian Statistical Institute Kolkata India Indian Institute of Technology Kanpur India University of Copenhagen Denmark Indian Institute of Technology Hyderabad India
Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have concentrated on proving that approximate ... 详细信息
来源: 评论
Enumerable classes of total recursive functions: Complexity of inductive inference  4th
收藏 引用
4th International Workshop on Analogical and Inductive Inference, AII 1994 and 5th International Workshop on Algorithmic Learning Theory, ALT 1994
作者: Ambainis, Andris Smotrovs, Juris Institute of Mathematics and Computer Science University of Latvia Raina bulv. 29 Riga Latvia
This paper includes some results on complexity of inductive inference for enumerable classes of total recursive functions, where enumeration is considered in more general meaning than usual recursive enumeration. The ... 详细信息
来源: 评论
Linear recursive functions
收藏 引用
作者: Alves, Sandra Fernández, Maribel Florido, Mário Mackie, Ian University of Porto Department of Computer Science LIACC R. do Campo Alegre 823 4150-180 Porto Portugal King's College London Department of Computer Science Strand London WC2R 2LS United Kingdom LIX CNRS UMR 7161 École Polytechnique 91128 Palaiseau Cedex France
With the recent trend of analysing the process of computation through the linear logic looking glass, it is well understood that the ability to copy and erase data is essential in order to obtain a Turing-complete com... 详细信息
来源: 评论
The foundations of intuitionistic mathematics : especially in relation to recursive functions /
The foundations of intuitionistic mathematics : especially i...
收藏 引用
1965年
作者: Kleene Stephen Cole
来源: 内蒙古大学图书馆图书 评论
Resilience modeling by means of a set of recursive functions
Resilience modeling by means of a set of recursive functions
收藏 引用
2013 43rd Annual IEEE/IFIP Conference on Dependable Systems and Networks Workshop, DSN-W 2013
作者: Pont, Maria Teresa Signes Chamizo, Juan Manuel Garcia Mora, Higinio Mora Pascual, Jeronimo Mora Departamento de Tecnología Informática y Computación Universidad de Alicante 03690 San Vicente del Raspeig - Alicante Spain
This paper presents a computational framework to approach the resilience properties of the systems in many different domains. The proposal models elementary behaviors of the systems by means of a set of recursive func... 详细信息
来源: 评论