Christopher Rackauckas ChrisRackauckas

This is a response to @akis on the Julia Discourse forum. I don't want to clutter the forum, there there are some things you have said in the last few days which are objectively false and so I feel like I have a duty to the community to make sure they are corrected. Please do not take this as an attack on you or your character, I only want to ensure people can read correct information.

Let me start with the one I find most amusing. I am sorry for writing this in a sarcastic manner, but I felt like it was too good of an opportunity to pass up. Yesterday, I stated here that:

I am pretty sure that a pinned post and mod intervention can easily make a big community switch to a new active forum in 14 days. Just a gut feeling.

You responded with:

>Thanks for clearing up that your objection is based either on "gut feeling" or rumors or lack of much care for anything beyond personal convenience. My own experience and research on th

	using DiffEqBase
	using OrdinaryDiffEq
	using ParameterizedFunctions

	params = [0.0]
	function dyn_eq(t,u,params,du)
	du .= [0 1;
	0 0]u + [0;1]params[1]
	end

	len = 10000
	function nosimd1(x,y,z,w)
	@inbounds for i in eachindex(x)
	x[i] += z[i]
	y[i] += w[i]
	end
	end
	function nosimd2(x,y,z,w)
	@inbounds for i in eachindex(x)
	x[i] += z[i]

	44 required packages:
	- AlgebraicDiffEq 0.1.0+ master
	- ApproxFun 0.4.1+ development
	- ArbFloats 0.1.15+ master
	- BandedMatrices 0.2.0
	- BenchmarkTools 0.0.6
	- ComposeDiff 0.0.2
	- DecFP 0.1.5
	- Decimals 0.1.0
	- DiffEqDevTools 0.6.0+ master

	N = 10
	λ=-0.1; tEnd=1000.
	tThreshold = 0.1
	u0 = zeros(4 * N)
	for i in 1 : N
	u0[2i - 1] = -5. + 10.rand()
	u0[2i] = -5. + 10.rand()
	u0[2N + 2i - 1] = 0.
	u0[2N + 2i] = 1.
	end

	importall Base
	import RecursiveArrayTools.recursivecopy!

	using DiffEqBase
	using OrdinaryDiffEq

	type SimType{T} <: AbstractArray{T,1}
	x::Array{T,1}
	f1::T
	end

	using DifferentialEquations, BenchmarkTools
	import ODE

	function vop_prop( x, dt::Float64 )
	reltol = 1e-5
	abstol = 1e-13
	maxstep = 300.0 #sec

	p = ODEProblem( vopeom,
	x,

	importall Base
	import RecursiveArrayTools.recursivecopy!

	using DifferentialEquations

	type SimType{T} <: AbstractArray{T,1}
	x::Array{T,1}
	f1::T
	end

	! 0 bytes Base.#!
	!= 0 bytes Base.#!=
	!== 0 bytes Base.#!==
	$ 0 bytes Base.#$
	% 0 bytes Base.#rem
	& 0 bytes Base.#&
	* 0 bytes Base.#*
	+ 0 bytes Base.#+
	- 0 bytes Base.#-
	.!= 0 bytes Base.#.!=