
Recent Posts
Subscribe to Complex Projective 4Space
Archives
 September 2021
 July 2021
 June 2021
 May 2021
 February 2021
 January 2021
 December 2020
 November 2020
 October 2020
 September 2020
 August 2020
 July 2020
 June 2020
 May 2020
 June 2019
 May 2019
 March 2019
 November 2018
 September 2018
 July 2018
 June 2018
 May 2018
 April 2018
 March 2018
 February 2018
 November 2017
 October 2017
 November 2016
 May 2016
 March 2016
 February 2016
 December 2015
 September 2015
 March 2015
 February 2015
 January 2015
 December 2014
 November 2014
 October 2014
 September 2014
 August 2014
 July 2014
 June 2014
 May 2014
 April 2014
 March 2014
 February 2014
 January 2014
 December 2013
 November 2013
 October 2013
 September 2013
 August 2013
 July 2013
 June 2013
 May 2013
 April 2013
 March 2013
 February 2013
 January 2013
 December 2012
 November 2012
 October 2012
 September 2012
 August 2012
Recent Comments
 Martin Andersen on The neural network of the Stockfish chess engine
 Danny Winters on Final chapter of MODA
 Ross Presser on Hamming backups: a 2of3 variant of SeedXOR
 An efficient prime for numbertheoretic transforms  Complex Projective 4Space on Complexity of integer multiplication almost solved
 SuperSupermario24 on Infinite monkey theorem
Monthly Archives: July 2021
Hamming cube of primes
Given two nonnegative integers, m and n, we say that they are Hammingadjacent if and only if their binary expansions differ in exactly one digit. For example, the numbers 42 and 58 are Hammingadjacent because their binary expansions 101010 and … Continue reading
Posted in Uncategorized
2 Comments
Determinacy
I’d like to take this opportunity to highly recommend Oscar Cunningham’s blog. One of the posts, entitled A Better Representation of Real Numbers, describes an elegant orderpreserving* bijection between the nonnegative reals [0, ā) and ‘Baire space‘, , the space … Continue reading
Posted in Uncategorized
Leave a comment
Oneway permutations
Oneway permutations are fascinating functions that possess a paradoxical pair of properties. They are efficiently computable functions Ļ from [n] := {0, 1, …, nā1} to itself that are: Mathematically invertible, meaning that Ļ is a bijection; Cryptographically uninvertible, meaning … Continue reading
Posted in Uncategorized
Leave a comment