#Booth's algorithm
-13 * 9 = -117
-13 = 10011
9 = 01001
Joseph (Jos) Smith smithcommajoseph
smithcommajoseph
/ 1_temp_knots_and_mat.ipynb
Last active
April 23, 2024 18:56
calculate_temp_knots and create_temp_matrix ported from R to Python
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
smithcommajoseph
/ Constraint Satisfaction.ipynb
Created
August 4, 2022 20:40
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
smithcommajoseph
/ Graph Theory Discussion.ipynb
Created
July 13, 2022 16:38
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
smithcommajoseph
/ joseph-smith-bird-species-kaggle-project.ipynb
Last active
June 26, 2022 14:57
Joseph Smith - Bird Species (Kaggle Project).ipynb
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
smithcommajoseph
/ MNIST_to_dataframes.r
Created
April 27, 2022 15:20
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # based on https://gist.github.com/daviddalpiaz/ae62ae5ccd0bada4b9acd6dbc9008706 | |
| # load image files | |
| load_image_file = function(filename) { | |
| f = gzfile(filename, 'rb') | |
| readBin(f, 'integer', n = 1, size = 4, endian = 'big') | |
| n = readBin(f, 'integer', n = 1, size = 4, endian = 'big') | |
| nrow = readBin(f, 'integer', n = 1, size = 4, endian = 'big') | |
| ncol = readBin(f, 'integer', n = 1, size = 4, endian = 'big') | |
| x = readBin(f, 'integer', n = n * nrow * ncol, size = 1, signed = FALSE) |
smithcommajoseph
/ truth-table-poc.js
Last active
February 23, 2021 16:12
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // truth table POC | |
| let vars = ['x1', 'x2', 'x3', 'x4'], | |
| r = Math.pow(2, vars.length), | |
| str = '', | |
| i, | |
| j; | |
| str += `\r\n\r\n` | |
| for (i = 0; i < vars.length; i++) { |
smithcommajoseph
/ tm-sample.txt
Created
January 29, 2021 16:50
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| q1 | |
| qAccept | |
| qReject | |
| 0,1 | |
| q1 (0,x,R) q2 | |
| q1 (y,y,R) q4 | |
| q1 ( , ,L) qAccept | |
| q1 (1, ,R) qReject | |
| q2 (0,0,R) q2 | |
| q2 (y,y,R) q2 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| dfa_start(dfa1, q0). | |
| dfa_final(dfa1, q3). | |
| dfa_transition(dfa1, q0, '0', q1). | |
| dfa_transition(dfa1, q0, '1', q1). | |
| dfa_transition(dfa1, q0, '.', q2). | |
| dfa_transition(dfa1, q1, '0', q1). | |
| dfa_transition(dfa1, q1, '1', q1). | |
| dfa_transition(dfa1, q1, '.', q3). | |
| dfa_transition(dfa1, q2, '0', q3). |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| module Dfa | |
| ( | |
| stateFactory | |
| , alphabet | |
| , allStates | |
| , firstState | |
| , acceptStates | |
| , allTransitions | |
| , transFromState | |
| , transLabel |
NewerOlder