primus852

#!/bin/bash

### steps ####
# verify the system has a cuda-capable gpu
# download and install the nvidia cuda toolkit and cudnn
# setup environmental variables
# verify the installation
###

### to verify your gpu is cuda enable check

davmillar

#!/usr/bin/perl
use MIME::Parser;
use URI::Find;
use File::Fetch;
use HTML::LinkExtractor;
use Data::Dumper;
use File::Copy qw(move);

# Configure path for the output.
my $output_dir = '/home/dmillar/Dropbox/To-Solve/';

alexellis

This guide has moved to a GitHub repository to enable collaboration and community input via pull-requests.

https://github.com/alexellis/k8s-on-raspbian

Alex

jdblischak

NAME := main

all: $(NAME).pdf

%.pdf: %.tex
	sed -i s/'\\includeonly'/'%\\includeonly'/ $(NAME).tex
	pdflatex -shell-escape $(NAME)
	# Insert additional calls to  pdflatex or bibtex here,
	# depending on the complexity of your document

lukechampine

The Y Combinator

The Y Combinator is a classic lambda calculus construct that many people find baffling. Here's my attempt to explain it as clearly as possible (no promises!). Familiarity with Haskell syntax is assumed.

The problem we're trying to solve is how to write an anonymous function (a "lambda") that is recursive. Normally, if you want to write a recursive function, it looks like this:

fac n = if n == 0 then 1
        else n * fac (n-1)

rxaviers

People

:bowtie:	😄 :smile:	😆 :laughing:
😊 :blush:	😃 :smiley:	☺️ :relaxed:
😏 :smirk:	😍 :heart_eyes:	😘 :kissing_heart:
😚 :kissing_closed_eyes:	😳 :flushed:	😌 :relieved:
😆 :satisfied:	😁 :grin:	😉 :wink:
😜 :stuck_out_tongue_winking_eye:	😝 :stuck_out_tongue_closed_eyes:	😀 :grinning:
😗 :kissing:	😙 :kissing_smiling_eyes:	😛 :stuck_out_tongue:

masak

Ok, I geeked out, and this is probably more information than you need. But it completely answers the question. Sorry. ☺

Locally, I'm at this commit:

$ git show
commit d6cd1e2bd19e03a81132a23b2025920577f84e37
Author: jnthn <[email protected]>
Date:   Sun Apr 15 16:35:03 2012 +0200

When I added FIRST/NEXT/LAST, it was idiomatic but not quite so fast. This makes it faster. Another little bit of masak++'s program.