- Sort Score
- Result 10 results
- Languages All
Results 1 - 8 of 8 for contradiction (0.2 sec)
-
src/cmd/compile/internal/ssa/poset.go
// #5: N2<=X<=N1 | N1<=N2 | collapse path (learn that N1=X=N2) // #6: N2<=X<=N1 | N1<N2 | contradiction // #7: N2<X<N1 | N1<=N2 | contradiction in the path // #8: N2<X<N1 | N1<N2 | contradiction if strict { // Cases #6 and #8: contradiction return false } // We're in case #5 or #7. Try to collapse path, and that will
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 04 17:23:05 UTC 2023 - 37.2K bytes - Viewed (0) -
src/math/big/natdiv.go
arrive at the idea of doing those exact calculations. Nowhere is it mentioned that this test extends the 2-by-1 guess into a 3-by-2 guess. The proof of the Good Guess Guarantee is only for the 2-by-1 guess and argues by contradiction, making it difficult to understand how modifications like adding another digit or adjusting the quotient range affects the overall bound. All that said, Knuth remains the canonical reference. It is dense but packed
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0) -
test/prove.go
// This tests for i <= cap, which we can only prove // using the derived relation between len and cap. // This depends on finding the contradiction, since we // don't query this condition directly. useSlice(b[:i]) // ERROR "Proved IsSliceInBounds$" } } func f18(b []int, x int, y uint) { _ = b[x] _ = b[y]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 23 00:02:36 UTC 2024 - 21.2K bytes - Viewed (0) -
LICENSE
the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Mon Jan 18 20:25:38 UTC 2016 - 25.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/fused_kernel_matcher.cc
if (!isa<func::FuncOp, IfOp, WhileOp>(contraction->getParentOp())) { return rewriter.notifyMatchFailure( contraction, "fused operation must be nested inside a function, If or While"); } // If the contraction is used in multiple places, fusing it will only create // more contraction nodes, which is slower. if (!contraction.getResult().hasOneUse())
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 14.9K bytes - Viewed (0) -
src/crypto/internal/boring/aes.go
NewGCM(nonceSize, tagSize int) (cipher.AEAD, error) } var _ extraModes = (*aesCipher)(nil) func NewAESCipher(key []byte) (cipher.Block, error) { c := &aesCipher{key: bytes.Clone(key)} // Note: 0 is success, contradicting the usual BoringCrypto convention. if C._goboringcrypto_AES_set_decrypt_key((*C.uint8_t)(unsafe.Pointer(&c.key[0])), C.uint(8*len(c.key)), &c.dec) != 0 ||
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jan 26 22:52:27 UTC 2024 - 10.2K bytes - Viewed (0) -
src/math/big/ratconv.go
// We start with the largest factor f = tab[len(tab)-1] // that evenly divides q. It does so at most once because // otherwise f·f would also divide q. That can't be true // because f·f is the next higher table entry, contradicting // how f was chosen in the first place. // The same reasoning applies to the subsequent factors. var p5 uint for i := len(tab) - 1; i >= 0; i-- { if t, r = t.div(r, q, tab[i]); len(r) == 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 15 22:16:34 UTC 2023 - 12.3K bytes - Viewed (0) -
src/math/big/nat.go
// // since all the yi for i > 1 are 0 by choice of k: If any of them // were > 0, then yh >= b^2 and thus y >= b^2. Then k' = k*2 would // be a larger valid threshold contradicting the assumption about k. // if k < n || m != n { tp := getNat(3 * k) t := *tp // add x0*y1*b x0 := x0.norm() y1 := y[k:] // y1 is normalized because y is
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 31.7K bytes - Viewed (0)