Register | Sign In


Understanding through Discussion


EvC Forum active members: 64 (9164 total)
5 online now:
Newest Member: ChatGPT
Post Volume: Total: 916,889 Year: 4,146/9,624 Month: 1,017/974 Week: 344/286 Day: 0/65 Hour: 0/0


Thread  Details

Email This Thread
Newer Topic | Older Topic
  
Author Topic:   Irreducible complexity- the challenges have been rebutted (if not refuted)
edge
Member (Idle past 1734 days)
Posts: 4696
From: Colorado, USA
Joined: 01-09-2002


Message 27 of 112 (1895)
01-11-2002 11:10 AM
Reply to: Message 26 by John Paul
01-11-2002 10:37 AM


quote:
Originally posted by John Paul:
John Paul:
You are repeating yourself. I read Behe and I read your link. Nothing has been demonstrated. No amount of shouting will change that. Sure a hypothetical has been presented and that is a start- but that is all it is.
Larry:
Yes, but a possibly pathway is all that is required to falsify Behe’s inference.
John Paul:
Just because something looks 'possible' on paper doesn't make it so.
True. However, when you compare something that is possible on paper with something that is impossible on paper, which do you run with?

This message is a reply to:
 Message 26 by John Paul, posted 01-11-2002 10:37 AM John Paul has replied

Replies to this message:
 Message 28 by John Paul, posted 01-11-2002 2:06 PM edge has not replied

  
Newer Topic | Older Topic
Jump to:


Copyright 2001-2023 by EvC Forum, All Rights Reserved

™ Version 4.2
Innovative software from Qwixotic © 2024