Search results

Results 1 – 20 of 343
Advanced search

Search in namespaces:

There is a page named "Talk:P-recursive equation" on Wikipedia

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • 70 bytes (0 words) - 05:02, 25 January 2024
  • situation exists with P-recursive equation, Polynomial solutions of P-recursive equations, Holonomic function, and Linear differential equation (though in this...
    23 KB (4,407 words) - 19:02, 16 July 2024
  • addition. projection: the s suffix on words makes things plural. p.r. versus primitive recursive: I personally think it was nicer with the abbreviation, but...
    68 KB (10,460 words) - 03:36, 9 March 2024
  • a basic tool to find explicit solutions to recursive equations, implicitly defining programs of recursive functions by circular definitions involving...
    7 KB (1,073 words) - 01:46, 9 March 2024
  • The article claims: The equation p ( x 1 , … , x k ) = 0 {\displaystyle p(x_{1},\ldots ,x_{k})=0} where p {\displaystyle p} is a polynomial of degree d...
    8 KB (1,260 words) - 10:05, 3 February 2024
  • statement of the Bellman equation for general x {\displaystyle x} would be more clearly derived from stating the recursive definition for general x t...
    15 KB (2,554 words) - 23:23, 14 January 2024
  • the term super-recursive algorithm and Burgin argues (on p. 115) that it's necessary to make a clear distinction between super-recursive algorithms and...
    114 KB (17,872 words) - 00:12, 15 March 2009
  • problem of left-recursive grammar rules. Such rules are extremely common, as for example EXPR = INT | EXPR + EXPR | EXPR * EXPR; A recursive descent parser...
    17 KB (2,421 words) - 17:20, 8 February 2024
  • 'Y can only be defined over recursive functions like plus', don't attempt to take the fixpoint using Y of a non-recursive one like f' then it makes sense...
    60 KB (9,539 words) - 22:23, 1 February 2024
  • primitive recursive functions (p. 287). BUT... Kleen produces examples from the literature to show that "there are non-elementary primitive recursive predicates"...
    13 KB (1,921 words) - 14:39, 10 June 2024
  • (by Roquette?); such that it is recursive in a definite sense, though it is not going to be provably primitive recursive or anything very useful by the...
    3 KB (439 words) - 22:21, 8 February 2024
  • paper General Recursive Functions of Natural Numbers, section 2 "The undecidability, in general, which systems of equations define recursive functions" (page...
    10 KB (1,537 words) - 01:46, 9 March 2024
  • number p that divides n. Equation (11) follows from a more elementary fact. If j {\displaystyle j} is a positive integer, ( n − 1 p j − 1 ) ≡ { 1 mod p if ...
    33 KB (4,651 words) - 18:47, 6 February 2024
  • expression with a primitive recursive predicate is equivalent to the minimization operation, because if P,Q,R are primitive recursive then so is the function...
    24 KB (3,522 words) - 06:22, 9 March 2024
  • "partial recursive (p.r.),", "Turing computable," and "computable" interchangeably. On the other hand, he equates the total functions with recursive resp...
    97 KB (15,359 words) - 06:26, 7 February 2024
  • reinvented some known results in p-adics. In particular the last step of the decryption requires to solve the equation ( 1 + n ) x = 1 + k n ( mod n s...
    3 KB (561 words) - 11:30, 31 January 2024
  • 85 bytes (0 words) - 06:35, 7 February 2024
  • understand it. Does anyone disagree? RandomP 23:56, 25 September 2006 (UTC) Why not make a new section on recursively presented groups, seperate from the first...
    23 KB (3,989 words) - 09:24, 8 February 2024
  • talking Hilbert space basis here? Also, is it correct that P_n solves the differential equation with parameter n, or is n used in two different senses here...
    14 KB (2,008 words) - 01:04, 27 February 2024
  • we used recursive/non-recursive terminology in the article, then we could sidestep the whole TIIR issue. I think we all agree that the Equation 1/canonical...
    54 KB (8,088 words) - 06:58, 1 February 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)