instead of posting sandboxed questions as answers to a meta question, it would be much better to have a way to post them as questions that are then able to be moved to main (like moderators can move questions between sites now)
i don't think it will ever happen (we never got a site design other than the network-wide redesign) but it would be nice
Solve the Halting Problem for Modilar SNISP
code-golf halting-problem decision-problem interpreter
In the spirit of Solve the Halting Problem for Befinge, let's define another 2D language called Modilar SNISP. Modilar SNISP has the following six instructions:
\ directs the instruction pointer...
Now remember, kids, we're parked in the Itchy lot
code-golf
Imagine a representation of a parking lot like this one:
*****************
* *
* ··CC··C··CC·· *
* ************* *
* ··CCCCCCCCC·· *
* *
**********E******
In this representation a * means a wall, a · a fr...
Imagine the following 24-hour clock that can be controlled by arrow keys:
╔══╗ ┌──┐
║00║:│00│
╚══╝ └──┘
HH mm
Pressing the up arrow twice (↑↑) will increase the currently focused hour input:
╔══╗ ┌──┐
║02║:│00│
╚══╝ └──┘
HH mm
Pressing the right arrow (→) will focus the other input.
...
Heres a quick idea: "Write a program within 500 bytes which, given an ideal computer, halts if and only if an axiom system is inconsistent. Answers are ranked by the consistency strength of the axiom systems they implement this program for."
That's just the elevator blurb, if it becomes a real question, I'll need to flesh out the details
It's inspired by the programs which go on an infinite search for an inconsistency in ZFC or some other theory and halt if they find one
Obviously this does not supply a well ordering of rankings, since some axiom systems, say ZFC+GCH and ZFC+Diamond, can't be precisely compared by consistency strength
But I can circumvent this by acknowledging this difficulty and yield a collective first place to all programs whose consistency strengh is not exceeded by another's
...or Toroidal Moore Neighbourhoods
Given positive integers h, w and a non-negative integer i, return all of the indices surrounding i.
You are to assume a matrix consisting of h rows of w elements, numbered from lowest, in the top left-hand corner, to highest, in the bottom right-hand corner,...
@Adám that URL (https://raw.github.com/SOBotics/chatexchange/mvn-repo/) returns an error 400. Not sure if it's because I've tried opening it in a browser
@J.Sallé I'm not sure, how gradle works, but we're not using the "mvn-repo" on GitHub anymore. We moved everything to Sonatype Central Repository: search.maven.org/…
Challenge
Given nine numbers, a, b, c, d, e, f, g, h, i, as input which correspond to the square matrix:
\$M = \begin{bmatrix}a& b& c\\ d& e& f\\ g& h& i\end{bmatrix}\$
Find the inverse of the matrix, \$M^{-1}\$ and output its components.
Inverse Matrix
The inverse of a matrix 3 by 3 obeys t...
Irrational Array indexing Starts at 3.
I came across this brilliant comment from a user named on the r/programmer humor subreddit context for the curious.
To fix the duplicate problem, instead take an extra digit whenever you are about
to duplicate a key: arr[3], arr[1], arr[4], arr[15],
arr[...
Now you can complains about languages having built-ins?
Looking at the comments, the built-in issue is the main one. Shaggy complains a bit about the defintion, but there was not a close vote for that. Besides, I expect everyone to know what a matrix inverse is.
From Japan, we have a product that disguises your phone charging cable as a VGA style D-SUB connector. You know, for kids. http://www2.elecom.co.jp/products/P-APLTDCNDSUB.html
About a month ago I spilled coke in my laptop. The laptop is fine but in the ensuing panic I disconnected my hard drive and the laptop stopped reading it
In a browser extension called OneTab, I had saved URLs of a great many tabs as a sort of very long list of bookmarks
Unfortunately it was all local
And I can't find that page of URLs in my Opera settings (I have yet to look in my Chrome settings but those were two different lists)
Do you have any suggestions on how I could retrieve my tabs at this stage?
Correction: the incident was just under two months ago now
@Sherlock9 For starters: Get a hard drive reader that can do read-only mode (writes can and will destroy your data). Then, use WinCDEmu to make a disk image.
Anonymous
Then you can start the process of trying to actually restore your stuff
Anonymous
Alternatively, you can use your Mac (or Cygwin on Windows, running as admin) to use dd to ensure that you get an accurate image
Sort an array of integers such that the odd numbers come first.
Shortest solution wins.
Solve the Halting Problem for Modilar SNISP
code-golf halting-problem decision-problem interpreter
In the spirit of Solve the Halting Problem for Befinge, let's define another 2D language called Modilar SNISP. Modilar SNISP has the following six instructions:
\ directs the instruction pointer...
Now remember, kids, we're parked in the Itchy lot
code-golf
Imagine a representation of a parking lot like this one:
*****************
* *
* ··CC··C··CC·· *
* ************* *
* ··CCCCCCCCC·· *
* *
**********E******
In this representation a * means a wall, a · a fr...
Imagine the following 24-hour clock that can be controlled by arrow keys:
╔══╗ ┌──┐
║00║:│00│
╚══╝ └──┘
HH mm
Pressing the up arrow twice (↑↑) will increase the currently focused hour input:
╔══╗ ┌──┐
║02║:│00│
╚══╝ └──┘
HH mm
Pressing the right arrow (→) will focus the other input.
...
...or Toroidal Moore Neighbourhoods
Given positive integers h, w and a non-negative integer i, return all of the indices surrounding i.
You are to assume a matrix consisting of h rows of w elements, numbered from lowest, in the top left-hand corner, to highest, in the bottom right-hand corner,...
Challenge
Given nine numbers, a, b, c, d, e, f, g, h, i, as input which correspond to the square matrix:
\$M = \begin{bmatrix}a& b& c\\ d& e& f\\ g& h& i\end{bmatrix}\$
Find the inverse of the matrix, \$M^{-1}\$ and output its components.
Inverse Matrix
The inverse of a matrix 3 by 3 obeys t...
Irrational Array indexing Starts at 3.
I came across this brilliant comment from a user named on the r/programmer humor subreddit context for the curious.
To fix the duplicate problem, instead take an extra digit whenever you are about
to duplicate a key: arr[3], arr[1], arr[4], arr[15],
arr[...
