partial recursive造句
例句与造句
- :: Definition of " partial recursive function " : " A partial function ? is partial recursive in [ the partial functions ] ? 1, . . . ? n if there is a system of equations E which defines ? recursively from [ partial functions ] ? 1, . . . ? n " ( p . 326)
- A recent treatment of the Minsky ( 1961 ) / Lambek ( 1961 ) model can be found Boolos-Burgess-Jeffrey ( 2002 ); they reincarnate Lambek's " abacus model " to demonstrate equivalence of Turing machines and partial recursive functions, and they provide a graduate-level introduction to both abstract machine models ( counter-and Turing-) and the mathematics of recursion theory.
- However, the reader needs to be cautioned that, even though the ? operator is easily created by the base instruction set doesn't mean that an arbitrary partial recursive function can be easily created with a base model-- Turing equivalence and partial recursive functions imply an " unbounded " ? operator, one that can scurry to the ends of the register chain ad infinitum searching for its goal.
- However, the reader needs to be cautioned that, even though the ? operator is easily created by the base instruction set doesn't mean that an arbitrary partial recursive function can be easily created with a base model-- Turing equivalence and partial recursive functions imply an " unbounded " ? operator, one that can scurry to the ends of the register chain ad infinitum searching for its goal.
- To be Turing equivalent the counter machine needs to either use the unfortunate single-register Minsky G鰀el number method, or be augmented with an ability to explore the ends of its register string, ad infinitum if necessary . ( A failure to find something " out there " defines what it means for an algorithm to fail to terminate; cf Kleene ( 1952 ) pp . 316ff " Chapter XII Partial Recursive Functions ", in particular p . 323-325 . ) See more on this in the example below.
- It's difficult to find partial recursive in a sentence. 用partial recursive造句挺难的
更多例句： 上一页